Graphs can be confusing, and graph algorithms may be complex. With graph algorithms you can create directed and undirected graphs, or (if you want something fancier) you can import or export graphs to gexf format (we limit import graphs to 50 nodes to avoid performance problems). The algorithms that we currently support are:

Depth First Search
Breadth First Search
Prim Minimum Spanning Tree
Kruskal Minimum Spanning Tree
Djikstra's shortest path
Bellman Ford
Floyd Warshall

You can visualize the animations with default delay times or you can check out the step by step mode.