COIN-OR::LEMON - Graph Library

source: lemon-0.x/lemon/belmann_ford.h

Revision Log Mode:


Legend:

Added
Modified
Copied or renamed
Diff Rev Age Author Log Message
(edit) @1858:a5b6d941ed52   14 years Balazs Dezso Bug fix in def pred map
(edit) @1857:2e3a4481901e   14 years Mihaly Barasz belmann_ford: * run() with length limit * bugfix in processNextRound()
(edit) @1816:19ee9133a28c   14 years Alpar Juttner - Spellcheck (pathes->paths) - todos
(edit) @1783:474666e89a2a   14 years Balazs Dezso One more bug fix
(edit) @1782:cb405cda0205   14 years Balazs Dezso Bug fix.
(edit) @1781:dca4c8a54e0a   14 years Balazs Dezso Path length limit for belmann_ford.h
(edit) @1765:f15b3c09481c   14 years Balazs Dezso Removing todos
(edit) @1763:49045f2d28d4   14 years Balazs Dezso pred => predEdge rename
(edit) @1754:4bf5ceb49023   14 years Balazs Dezso Documentation modified
(edit) @1741:7a98fe2ed989   14 years Balazs Dezso Some modifications on shortest path algoritms: - heap traits - …
(edit) @1723:fb4f801dd692   14 years Balazs Dezso Really short description of these shortest path algorithms
(edit) @1710:f531c16dd923   14 years Balazs Dezso Bug solved in named parameters Simplify my Johnson algorithm
(add) @1699:29428f7b8b66   14 years Balazs Dezso Some shortest path algorithms All-pair-shortest path algorithms …
Note: See TracRevisionLog for help on using the revision log.