Depth First Search Algorithm
{"Image DocumentName": "Depth First Search Algorithm", "Image ImageDescription": "STACK: E, B, G. PRINT: C. Pop and Print the top element of the STACK, that is, G. Push all the neighbors of G on to the stack that are in the ready state. Since there are no neighbors of G that are in the ready state no push operation is performed. The STACK now becomes: PRINT G: STACK: E, B. Pop and Print the top element of the STACK, that is, B. Push all the neighbors of B on to the stack that are in the ready state. Since there are no neighbors of B that are in the ready state no Push operation is performed. The STACK now becomes: STACK: E. PRINT e: Pop and Print the top element of the STACK, that is, E. Push all the neighbors of E on to the stack that are in the ready state. Since there are no neighbors of E that are in the ready state no Push operation is performed. The STACK now becomes empty: PRINT: E. Since the STACK is now empty, the depth-first search of G starting at node H is complete and the nodes which were printed are-H, I, F, C, G, B E. These are the nodes which are reachable from the node H.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}