Graph Traversal Algorithm: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "** ..." to "** …") |
m (Text replacement - "Category:Concept __NOTOC__" to "__NOTOC__ Category:Concept") |
||
| Line 17: | Line 17: | ||
---- | ---- | ||
__NOTOC__ | |||
[[Category:Concept]] | [[Category:Concept]] | ||
Revision as of 18:41, 4 March 2021
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):
- 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.