COIN-OR::LEMON - Graph Library

Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/bellman_ford_test.cc

    r960 r1160  
    191191
    192192  ListPath<Digraph> path;
    193   Value dist;
     193  Value dist = 0;
    194194  bool reached = bellmanFord(gr,length).path(path).dist(dist).run(s,t);
    195195
Note: See TracChangeset for help on using the changeset viewer.