Graphing Algorithms
Graph traversal algorithms can be applied in various data processing scenarios.
Breadth first search
Breadth first searching is a way of searching that involves searching through all the unsearched nodes at the highest level and working downwards
Depth first search
Depth first search is a way of searching that looks at nodes connected by edges before searching nodes at the same level.
Shortest path algorithm
Shortest path algorithms are used to minimise some cost function (distance), when moving from one node to another node in some sort of graph structure.
Shortest path algorithms are used in:
- network routing
- transportation planning
- robot motion planning