BFS Algorithm
BFS is a traversing algorithm where you should start traversing from a selected node (source or starting node) and traverse the graph layerwise thus exploring the neighbour nodes (nodes which are directly connected to source node). You must then move towards the next-level neighbour nodes.
For more
DFS Algorithm
All the nodes will be visited on the current path till all the unvisited nodes have been traversed after which the next path will be selected.
For more
Dijkstra Algorithm
The algorithm keeps track of the currently known shortest distance from each node to the source node and it updates these values if it finds a shorter path.
For more