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

Hi, I have an excellent problems solving skills in the domain of Engineering, Sciences, and Modelling Solutions for any topic. I gained my strong problem-solving skills with the problems I solved in elite schools with top grades, and hence can now think in direction of problem solving as a generic thing. Apart from profession, I have inherent interest in writing especially about Global Issues of Concern, poems, stories, doing painting, cooking, photography, music to mention a few! And most important on my website you can find my suggestions to latest problems, views and ideas, my poems, stories, novels, my comments, my proposals for people with funding's to implement, my blogs, my interests, my personal experiences and glimpses of my research work as well.

One thought on “Graph Search Techniques

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google photo

You are commenting using your Google account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: