Paths

'Path' is an application all about graph theory. These graphs are equivalent to transportation networks, sociograms, simplexes, electric circuits, organization diagrams, communication networks and even genealogical trees.
Thus, it has wide application to many disciplines.

Paths is intended to be educational, entertaining and useful in practice.

Paths provides solutions for maximum flow problems and for the major problems involving undirected graphs. It is a good companion to the application 'Analyze Graphs' which is primarily concerned with directed graphs. Paths applies graph theory to analyzing graphs and solving some additional classical problems. These include finding maximum flow, solving the traveling salesman problem by brute force (for small graphs), by a genetic algorithm and by other means, finding Hamiltonian circuits and Eulerian trails as well as determining shortest routes. Paths includes textual and graphical views, provides for creating graphs, can maintain a log, process files and more.