Graphs and algorithms

L3, INSA-Toulouse, 2018

This course presents some graph theory and their algorithms:

  • Topological sort and level structure
  • Breadth-first and depth-first search
  • Shortest path algorithms: Dijkstra, Bellman-Ford
  • Maximum flow / minimum cut with Ford-Fulkerson algorithm