Denigma

Change - Traversal

Created on Feb. 20, 2013, 4:51 p.m. by Hevok & updated on Feb. 20, 2013, 4:52 p.m. by Hevok

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.
Tags: access storage lookup retrieval data
Images: example-scc-graph.png database_indexes.jpg
Comment: Eliminated wrong image.

Comment on This Data Unit