graph solutions: a Mathematica
® Package to Solve Graph Problems
| Shortest Paths | | Spanning Trees |
| Maximum Flows | | Minimum Cost Flows |
| Traveling Salesman | | Chinese Postman |
| Bipartite Matching | | General Matching |
- Connectivity
- Cycle Detection
- Special Structures (tree, topological order)
- Self-Loops and Parallel Edges
- Rank of Vertices
- Graph Visualization
- Random Graphs for Tests
- Conversions
- exact methods for education
heuristic methods for practice
- safe interfaces for prototyping
efficient interfaces for productive systems
- object oriented graph representation
in matrix or list form
- high performance
by use of efficient Mathematica functions and compilation of all methods
- publication of performance
order of algorithms and
run time measurements