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
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 memory management of lists in Python, focusing on the constant time operations to access, add, and delete elements. It also delves into graph representation and traversal, comparing adjacency lists and matrices. The instructor explains the concepts of breadth-first search (BFS) and depth-first search (DFS) algorithms, highlighting their differences and applications in graph traversal.
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