Xoviabcs's video: Graph Traversals: Breadth First Search Depth First Search BFS DFS

Breadth First Search (BFS) & Depth First Search (DFS) and Articulation Points | Graph Traversal Algorithms. Breadth first search, also known as BFS, finds shortest paths from a given source vertex to all other vertices, in terms of the number of edges in the paths. Breadth-first search assigns two values to each vertex v vv: A distance, giving the minimum number of edges in any path from the source vertex to vertex v vv. The predecessor vertex of v vv along some shortest path from the source vertex. The source vertex's predecessor is some special value, such as null, indicating that it has no predecessor. If there is no path from the source vertex to vertex v vv, then v vv's distance is infinite and its predecessor has the same special value as the source's predecessor. Depth First Search (DFS) algorithm traverses a graph in a depthward motion and uses a stack to remember to get the next vertex to start a search, when a dead end occurs in any iteration. It employs the following rules. − Visit the adjacent unvisited vertex. Mark it as visited. Display it. Push it in a stack. − If no adjacent vertex is found, pop up a vertex from the stack. (It will pop up all the vertices from the stack, which do not have adjacent vertices.) − Repeat Rule 1 and Rule 2 until the stack is empty. Articulation Points in a Graph: A vertex in an undirected connected graph is an articulation point iff removing it disconnects the graph. Articulation points represent vulnerabilities in a connected network – single points whose failure would split the network into 2 or more disconnected components. They are useful for designing reliable networks. For a disconnected undirected graph, an articulation point is a vertex removing which increases number of connected components. C Programming Tutorial/ Lectures/ Course with Data Structures & Algorithms @ https://goo.gl/K6VbgL Machine Learning Complete Tutorial/Lectures/Course from IIT (nptel) for GATE @ https://goo.gl/AurRXm Discrete Mathematics for Computer Science for GATE @ https://goo.gl/YJnA4B (IIT Lectures for GATE) Best Programming Courses @ https://goo.gl/MVVDXR Operating Systems Lecture/Tutorials from IIT for GATE CSE @ https://goo.gl/GMr3if MATLAB Tutorials for GATE @ https://goo.gl/EiPgCF