dunkelheit reference

dkh.graph.dijkstra

calc shortest path

  • DijkstraInfo

    Declaration

    struct DijkstraInfo(T);

    information of shortest path

    • dist

      Declaration

      T[] dist;

      distance

    • from

      Declaration

      int[] from;

      there is a shortest path (s, ..., from[i], i)

  • dijkstra

    Declaration

    DijkstraInfo!D dijkstra(D, T)(T g, int s, D inf = D.max);

    calc shortest path with O(ElogE)

  • dijkstraDense

    Declaration

    DijkstraInfo!D dijkstraDense(D, T)(T g, int s, D inf = D.max);

    calc shortest path with O(V^2)