Graph Traversal Algorithm

A Graph Traversal Algorithm is a search algorithm that can be applied by a graph traversal system (to solve a graph traversal task).

• AKA: Graph Search Method.
• Context:
  • It can range from being an Exact Graph Traversal Algorithm to being an Approximate Graph Traversal Algorithm.
  • …
• Example(s):
  • Tree Search Algorithm.
• See: Breadth-First Search.

---

---

References

2015

• (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Graph_traversal Retrieved:2015-5-10.
  • In computer science, graph traversal is the problem of visiting all the nodes in a graph in a particular manner, updating and/or checking their values along the way. Tree traversal is a special case of graph traversal.

---