id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc
11804,Contribution: edge-disjoint k-shortest paths,Irek Szcześniak <irek@…>,Jeremiah Willcock,"Hi,

I want to contribute a function that calculates edge-disjoint k-shortest paths.

The algorithm searches for a shortest path.  Then it disables the edges of the shortest path, and repeats the search.  On so on, until no path can be found.

I'm attaching the source file and a unit test.

There are two things that bug me in the code:

* the predecessor map is hardcoded as:

  boost::vector_property_map<edge_descriptor> pred(num_vertices(g));

  while perhaps it should depend on the graph type,

* the formatting of this call is ugly:

  boost::dijkstra_shortest_paths
    (fg, s,
     visitor(make_dijkstra_visitor(record_edge_predecessors(pred, on_edge_relaxed()))));

I would appreciate it, if someone could give me a hint on these two problems.

I would also appreciate very much any comments and improvements.

Thanks!
  ",Library Submissions,new,To Be Determined,graph,Boost 1.57.0,Not Applicable,,,