Breadth First Search (BFS) pada Graph
Download as PPTX, PDF0 likes387 views
Slide ini menjelaskan mengenai konsep dan langkah-langkah Algoritma Breadth First Search (BFS) pada Graph. Slide disusun oleh Achmad Solichin | http://achmatim.net
Ad
More Related Content
What's hot (20)
Similar to Breadth First Search (BFS) pada Graph (20)
Ad
More from Achmad Solichin (20)
Ad
Recently uploaded (20)
Breadth First Search (BFS) pada Graph
- 1. BREADTH FIRST SEARCH (BFS) PADA GRAPH Algoritma dan Struktur Data Dr. Achmad Solichin, S.Kom, M.T.I
- 2. GRAPH V = {0, 1, 2, 3} E = {(0,1), (0,2), (0,3), (1,2)} G = {V, E} Indirect Graph
- 3. GRAPH TERMINOLOGY Adjacency: A vertex is said to be adjacent to another vertex if there is an edge connecting them. Vertices 2 and 3 are not adjacent because there is no edge between them. Path: A sequence of edges that allows you to go from vertex A to vertex B is called a path. 0-1, 1-2 and 0-2 are paths from vertex 0 to vertex 2. Directed Graph: A graph in which an edge (u,v) doesn't necessarily mean that there is an edge (v, u) as well. The edges in such a graph are represented by arrows to show the direction of the edge.
- 4. GRAPH REPRESENTATION 1. Adjacency Matrix 2. Adjacency List
- 5. BREADTH FIRST SEARCH (BFS) ALGORITHM The BFS algorithm works as follows: 1. Start by putting any one of the graph's vertices at the back of a queue. 2. Take the front item of the queue and add it to the visited list. 3. Create a list of that vertex's adjacent nodes. Add the ones which aren't in the visited list to the back of the queue. 4. Keep repeating steps 2 and 3 until the queue is empty.
- 6. STEP BY STEP BFS ALGORITHM – 1 We use an undirected graph with 5 vertices
- 7. STEP BY STEP BFS ALGORITHM – 2 We start from vertex 0, the BFS algorithm starts by putting it in the Visited list and putting all its adjacent vertices in the queue.
- 8. STEP BY STEP BFS ALGORITHM – 3 Next, we visit the element at the front of queue i.e. 1 and go to its adjacent nodes. Since 0 has already been visited, we visit 2 instead.
- 9. STEP BY STEP BFS ALGORITHM – 4 Vertex 2 has an unvisited adjacent vertex in 4, so we add that to the back of the queue and visit 3, which is at the front of the queue.
- 10. STEP BY STEP BFS ALGORITHM – 5 Only 4 remains in the queue since the only adjacent node of 3 i.e. 0 is already visited. We visit it. Since the queue is empty, we have completed the Depth First Traversal of the graph
- 12. BFS IMPLEMENTATION IN PROGRAMMING C C++ Java https://qrgo.page.link/x9Seghttps://qrgo.page.link/f5aH4https://qrgo.page.link/AZAnW
- 13. REFERENCES Slide “Graph: Pemahaman dan Konsep Dasar Graph – Algoritma dan Struktur Data 3” by Moh. Sjukani (Universitas Budi Luhur) Slide “Graph Traversal (Penelusuran Graph) – Algoritma dan Struktur Data 3” by Achmad Solichin (Universitas Budi Luhur) BFS Algorithm - https://www.programiz.com/dsa/graph-bfs
- 14. TERIMA KASIH Dr. Achmad Solichin, S.Kom., M.T.I. Fakultas Teknologi Informasi, Universitas Budi Luhur [email protected] | [email protected] http://achmatim.net