Graph Search Techniques

The graph search techniques in todays scenario be broadly be classified as:

  1. 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“

Published by Nidhika

In the Futuristic with AI and Tech blog, Nidhika Yadav covers topics of and related to Future of World with Artificial Intelligence. She primarily talks about AI applications for good. She also talks about how AI can become harmful. She manages two independent blogs here, and one is hobby blog you can subscribe one or all of them. 1. Blog on Artificial Intelligence and future. https://nidhikayadav.org 2. In Blog on Global Issues and future, she covers important international issues and their future implications. https://nidhikayadav.com/ 3. Blog on cooking. This is a hobby blog. Here she describes some delicious innovations and nutritious food. https://nidhikasrecipes.com/ Do subscribe to one or all of them.

One thought on “Graph Search Techniques”

Leave a Reply