Changeset 44717


Ignore:
Timestamp:
Apr 22, 2008, 12:24:25 PM (10 years ago)
Author:
Douglas Gregor
Message:

Resource-constrained shortest paths, from Michael Drexl

Location:
trunk
Files:
4 added
3 edited

Legend:

Unmodified
Added
Removed
  • trunk/libs/graph/doc/history.html

    r43209 r44717  
    7979  <a name="1.35.0"></a><li>Version 1.35.0<br><b>New algorithms and components</b>
    8080    <ul>
     81      <li><a href="r_c_shortest_paths.html"><tt>r_c_shortest_paths</tt></a>, resource-constrained shortest paths, from Michael Drexl.</li>
     82    </ul>
     83  </li>
     84
     85  <a name="1.35.0"></a><li>Version 1.35.0<br><b>New algorithms and components</b>
     86    <ul>
    8187      <li><a href="kolmogorov_max_flow.html"><tt>kolmogorov_max_flow</tt></a>, from Stephan Diederich as part of the <a href="http://code.google.com/soc/">2006 Google Summer of Code</a>.</li>
    8288      <li><a href="read_dimacs.html">read_dimacs_max_flow</a> and <a href="write_dimacs.html">write_dimacs_max_flow</a> for max-flow problems, from Stephan Diederich.</li>
  • trunk/libs/graph/doc/table_of_contents.html

    r43680 r44717  
    144144                    href="./johnson_all_pairs_shortest.html"><tt>johnson_all_pairs_shortest_paths</tt></A>
    145145                    <li><a href="floyd_warshall_shortest.html"><tt>floyd_warshall_all_pairs_shortest_paths</tt></a></li>
     146                    <li><a href="r_c_shortest_paths.html"><tt>r_c_shortest_paths</tt> - resource-constrained shortest paths</a></li>
    146147                  </OL>
    147148                <LI>Minimum Spanning Tree Algorithms
  • trunk/libs/graph/test/Jamfile.v2

    r40864 r44717  
    134134        : $(PLANAR_INPUT_FILES) ]
    135135
     136    [ run r_c_shortest_paths_test.cpp ]
     137
    136138    $(optional_tests)
    137139    ;
Note: See TracChangeset for help on using the changeset viewer.