Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the fundamentals of graph algorithms, including graph traversal, graph representation, and data structures for breadth-first search (BFS) and depth-first search (DFS). It explains the concepts of vertices, edges, directed and weighted graphs, adjacency matrix, and adjacency lists. The instructor discusses the iterative and recursive versions of DFS and BFS, highlighting the differences in their implementations. Additionally, the lecture explores the use of stacks and queues in Python for graph traversal algorithms, emphasizing the importance of choosing the right data structure for efficient operations.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace