Search Results for "graph c#"
Sort By:
Showing 5 open source projects for "graph c#"
View related business solutions-
Exact Payments delivers easy-to-integrate embedded payment solutions enabling you to rapidly onboard merchants, instantly activate a variety of payment methods and accelerate your revenue — delivering an end-to-end payment processing platform for SaaS businesses.
-
Our robust pre-built connectors and our no-code, drag-and-drop interface makes it easy and fast to automatically sync vendors, invoices, and invoice payment data between Tipalti and your ERP or accounting software.
-
1
UVA Arena
UVA Arena is a utility application to practice problem solving.
UVA Arena (c) 2014, is a windows based, non-commercial, open source utility application to make problem solving easier for the programmers. It is based on popular UVA Online Judge and uses APIs from uHunt. Main target of this software is to provide an useful and informative tool to help with programming practice. Today programming has become a very competitive field. You need to keep track of your progress daily, learn new things, and of-course solve new problems as fast as you can. Problem... -
2
WordMat
Math in Word
WordMat is an add-on to Microsoft Word which creates a tab with math functionality. Part of the Math functionality is provided by other open-source applications like Maxima, GeoGebra, Graph and GnuPlot. -
3
A Virtual Masking environment developed by Purdue Doctor of Audiology and Engineering students participating in the Engineering Projects in Community Service (EPICS) class under the guidance of Dr. Robert E. Novak and Dr. Carla Zoltowski.
-
4
An Education Microprocessor Simulator, based off the a design by Charles Stroud (http://www.eng.auburn.edu/~strouce/ausim.html), this will extend the capabilities and UI of the original and will have a VHDL implementation for educational purposes.
-
Don’t let unpaid invoices limit your business’s growth. EBizCharge plugs directly into the tools your business already uses to speed up payment collection.
-
5
Path Partitioner
Finds bad examples for the local search Path Partitioning algorithm
Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations...
- Previous
- You're on page 1
- Next