Outside the high school program / Graph 57 exercises (including 51 corrected)

• Sharing by levels (Bellman algorithm in a circuitless graph) (3 exercices)
• Linear programming: simplex method (2 exercices)
• Simplex algorithm (1 exercice)
• TD 5 L4 (5 exercices)
• TD 6 L4 (5 exercices)
• TD 7 L4 (4 exercices)
• TD 8 L4 (2 exercices)
• Graph coloring (7 exercices)
• Eulerian chain and cycle (16 exercices)
• Labeled graph (1 exercice)
• Dijkstra's algorithm (10 exercices)
• Dijkstra algorithm with path equalities (3 exercices)
• Annales (3 exercices)