Generalities about graphs -- The shortest path problem in a graph -- Path algebras -- Trees and arborescences -- Flows and transportation networks -- Flows with gains, multicommodity flows -- Matchings and ♭-matchings -- Eulerian and hamiltonian walks -- Matroids -- Non-polynomial problems -- Branch and bound algorithms -- Approximate algorithms
