COIN-OR::LEMON - Graph Library

Custom Query (545 matches)

Filters
 
Or
 
  
 
Columns

Show under each result:


Results (85 - 87 of 545)

Ticket Resolution Summary Owner Reporter
#181 done Support multiple targets for Suurballe Peter Kovacs Alpar Juttner
Description

The concept is that

run(s,t,k);

would do just as it does now, but in addition to it, there would be a function

init(s);

performing a full Dijkstra and computing reduced arc costs, which could be then followed by several

start(t,k);

execution, each of them would reverse the arcs on the shortest s-t path found by init(s) and execute partial Dijkstra to t only k-1 times.

It could speed up the use cases when k arc-disjoint s-t paths are needed for a lot of t nodes (e.g. all t!=s nodes).

#184 done Bibliography for LEMON Peter Kovacs Peter Kovacs
Description

It would be useful if we have references (books, articles etc.) for the algorithm and data structure implementations and other parts of the library. Especially if we also target scientists.

The main question is how to add bibliography to the doxygen documentation, e.g. from a bibtex file.

Several solutions exists for this purpose, we should check them, decide which one to use and add it to the build system.

This question arose in #176. Alpar wrote there:

... bibtex2html is not really a ubiquitous tools, maybe because it is written in the somewhat exotic !OCaml language. We may also want to have a look at these (in the future):

#185 fixed Doc improvements for BFS/DFS/Dijkstra Peter Kovacs Peter Kovacs
Note: See TracQuery for help on using queries.