Discrete Mathematics, Optimization, and Convexity
Department of Mathematics
Technical University of Munich
TUM_Web_Logo_blau
TUM
Spanning Trees
Prim's Algorithm
Kruskal's Algorithm
Matching
Blossom Algorithm
Hopcroft-Karp
Hungarian Method
Network Flow
Cycle Cancelling
Ford-Fulkerson
Routing
Chinese Postman
Hierholzer's Algorithm
TSP Game
Shortest Paths
A* Algorithm
Bellman-Ford
Dijsktra's Algorithm
Floyd-Warshall
EN
DE
Home
Routing
Traveling Salesperson Problem
Traveling Salesperson Problem
© Department of Mathematics
Data Protection Declaration
Legal Notice & Imprint