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

I have an eager research-based approach to solve problems in the various areas using my expertise. I find solutions based on my experience, research skills, strong knowledge Apart from profession, I have inherent interest in writing especially poems, stories, doing painting, cooking, photography, music to mention a few! And most important on my website you can find my views, ideas, my poems, stories, novels, my comments, my proposals, my blogs, my interests, my personal experiences and short occasional 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: