Denigma

Traversal

Created on Feb. 20, 2013, 4:51 p.m. by Hevok & updated by Hevok on May 2, 2013, 5:06 p.m.

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.
example-scc-graph.png

Tags: lookup, storage, access, retrieval, data
Categories: Tutorial
Parent: Graph Database

Update entry (Admin) | See changes

Comment on This Data Unit