Library Home || Full Table of Contents || Suggest a Link || Library Help
|A tool for graph theory, featuring a strong graph generator and more than 15 algorithms (e.g. Shortest Path, Maximum Flow, Minimum Cut, Maximum Clique, Maximal Subset of Independent Vertices, Eulerian Path/Circuit, Hamiltonian Path/Circuit, Chinese Postman Problem, Graph Center, Graph Median etc.). For Windows machines, available for download and purchase online.|
|Resource Types:||Topic Tools Miscellaneous|
|Math Topics:||Graph Theory|
© 1994-2013 Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.