|
|
Boost-Commit : |
Subject: [Boost-commit] svn:boost r52537 - branches/release/libs/graph/doc
From: jewillco_at_[hidden]
Date: 2009-04-22 09:22:56
Author: jewillco
Date: 2009-04-22 09:22:55 EDT (Wed, 22 Apr 2009)
New Revision: 52537
URL: http://svn.boost.org/trac/boost/changeset/52537
Log:
Merged in changes from trunk (fixed HTML comment syntax, added entry for r_c_shortest_paths)
Text files modified:
branches/release/libs/graph/doc/table_of_contents.html | 11 ++++++-----
1 files changed, 6 insertions(+), 5 deletions(-)
Modified: branches/release/libs/graph/doc/table_of_contents.html
==============================================================================
--- branches/release/libs/graph/doc/table_of_contents.html (original)
+++ branches/release/libs/graph/doc/table_of_contents.html 2009-04-22 09:22:55 EDT (Wed, 22 Apr 2009)
@@ -1,10 +1,10 @@
<HTML>
<!--
- -- Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
- --
- -- Distributed under the Boost Software License, Version 1.0.
- -- (See accompanying file LICENSE_1_0.txt or copy at
- -- http://www.boost.org/LICENSE_1_0.txt)
+ Copyright (c) Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine 2000
+
+ Distributed under the Boost Software License, Version 1.0.
+ (See accompanying file LICENSE_1_0.txt or copy at
+ http://www.boost.org/LICENSE_1_0.txt)
-->
<Head>
<Title>Table of Contents: Boost Graph Library</Title>
@@ -146,6 +146,7 @@
<LI><A
href="./johnson_all_pairs_shortest.html"><tt>johnson_all_pairs_shortest_paths</tt></A>
<li>floyd_warshall_all_pairs_shortest_paths</li>
+ <li>r_c_shortest_paths - resource-constrained shortest paths</li>
</OL>
<LI>Minimum Spanning Tree Algorithms
<OL>
Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk