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.
Lecture
Graph Algorithms II: Traversal and Paths
Description
This lecture covers graph algorithms focusing on traversal methods like breadth-first search (BFS) and depth-first search (DFS). It explains the concepts of spanning trees, shortest paths, and minimum spanning trees. The instructor discusses the importance of data structures for efficient traversal and explores the application of these algorithms in various scenarios.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.