The graph search techniques in todays scenario be broadly be classified as:
- Computer Science based Graph Search
This class caters to most traditional algorithms of Graph based search which include:
a. Depth Firth Search (DFS)
b. Breadth First Search (BFS)
c. Dijkstra’s Search Algorithm
d. Travelling Salesman Problem
e. Hybrid–DFS-BFS
f. Graph Coloring Algorithms
g Kruskal, Prims Algorithms……………list goes on but the above mentioned are most popular ones
2. Artificial Intelligence based Graph Search
These Algorithms adds AI into search techniques. These come in more as a separate topic to be discussed. The most popular kind of algorithm for the topic is “AI based Heuristic Graph Search“
One thought on “Graph Search Techniques”
You must log in to post a comment.