Adjacent Matrix
Incidence Matrix
List Edge
List Adjacent Vertices
DFS (Deep First Search)
BFS (Breadth First Search)
Euler (Euler Path)
Kruskal (Minium Spanning Tree)
Prim (Minium Spanning Tree)
Dijkstra's (Shortest Path - 1 to all)
Bellman-Ford (Shortest Path - 1 to all - negative edges allowed)
Floyd (Shortest Path - all pairs of vertices - negative edges allowed)