Draw and explore graphs. Apply several algorithms at once.

There are such algorithms:

1. Minimum spanning tree.
2. Single-Source Shortest Paths (Dijkstra algorithms).
3. All-pairs shortest paths.
4. Transitive closure.
5. Maximum flow (The relabel-to-front algorithm)
6. Chromatic painting.
7. Gamilton cycle(slow algorithm).
8. Topological sort.
9. Strongly connected, semiconnected?
10. Is network?
11. Has cycles?

You can draw graph and apply several algorithms at once. If you change
graph all solutions will be recalculated.
Graphs can be file-saved. Edge modifications undo/redo.