Start
User Group
Applications
Functions
General
Graph Properties
Trees
Paths and Tours
Shortest Paths
Traveling Salesman
Chinese Postman
Networks
Matchings
Bipartite
General
Algorithms
Various Methods
High Performance
Protocols
Interface
Graph Representation
Easy Interface
Fast Interface
License Model
Order
Resources
Glossary
FAQ
Links
Contact
<
>
Editorial/Data Protection
Submenu Paths and Tours
..
Find the shortest path (Dijkstra and more)
Shortest Paths
Vertex tours (closed, non-closed, stations)
Traveling Salesman
Edge tours (Euler)
Chinese Postman