Osnutek odseka

  • Mitja Trampuš

    Vsebina:

    • Najkrajše poti
      • Floyd-Warshallov algoritem
      • Dijkstrov algoritem
      • Bellman-Fordov algoritem, detekcija neg. ciklov
    • Strongly connected components (krepko povezane komponente)
    • Link hopping (lowest common ancestor problem)
    • Ford-Fulkerson - max pretok, min prerez
    • Min cost max flow, dvodelno prirejanje
      • "Successive shortest path" algoritem
      • Prevod problema prirejanja na min cost max flow problem