This application demonstrates various graph algorithms as described in the book "Algorithms" by Robert Sedgewick and Kevin Wayne. Algorithms included are:
- Depth First Paths
- Breadth First Paths
- Connected Components
- Cycle
- Two Color
- Symbol Graph
- Degrees of Separation
- Directed Depth First Search
- Directed Cycle
- Depth First Ordering
- Topological Ordering
- Kosaraju Strongly Connected Components
- Prim Minimum Spanning Tree
- Kruskal Minimum Spanning Tree
- Dijkstra Shortest Paths
- Acyclic Shortest Paths
- Bellman Ford Shortest Paths

To add a vertex to a graph, tap on the screen. To add an edge to a graph, tap on the start vertex and then tap on the end vertex. For path finding algorithms, long press on the start vertex and then long press on the end vertex to find the path.