Please enable JavaScript.
Coggle requires JavaScript to display documents.
Graph traverse Searching (visits all nodes of the graph using BFS (Keep…
Graph traverse Searching
Language
Python 3.6
Python IDLE
Algorithm
Searching Algorithms
Breadth First Search (BFS)
Algorithm for Traversing and searching a node in a graph
Depth First Search(DFS)
Algorithm for traversing and searching a node in a graph
Console Application (Runs on a console)
Basic Interface is added
visits all nodes of the graph using BFS
Keeps Tracks of all visited nodes
Keeps track of nodes to be checked
depth of start node is 0
Keep looping until all the nodes are checked
Keep looping until the nodes list are empty
Keep looping until the goal state is found
Applications
find shortest path between two nodes
Social networking
Web crawling
pop first node from the queue
Add neighbors of node to the queue