graph dijkstra_shortest_paths_no_color_map metodu

Şöyle yaparız.

// Compute maxmin tree
dijkstra_shortest_paths_no_color_map(
    graph, // Graph
    root_vertex, // Start vertex
    weight_map(...). // Link property map
    distance_compare(...). // Compare maxmin path lengths (if maxmin > maxmin)
    distance_combine(...). // Get min weight of the path
    predecessor_map(...). // Result tree
    distance_map(...) // Result distances
);