Traversal

A Graph Traversal is the problem of visiting all the Nodes in a Graph in a particular manner. There are bunch of algorithms to solve this:

• A* Search

• Alpha-beta prunning

• Breadth-First Search (BFS)

• Depth-First Search (DFS)

• Dijkstra's algorithm

• Floyd-Warshall's algorithm

• etc.