|
|
@@ -136,7 +136,7 @@
|
|
|
Indiana University.</li>
|
|
|
<li><a href="libs/graph/doc/dijkstra_shortest_paths.html"><tt>dijkstra_shortest_paths</tt></a> now uses a relaxed heap [<A
|
|
|
HREF="libs/graph/doc/bibliography.html#driscoll88">61</A>] as its priority queue, improving its complexity to <em>O(V log V)</em> and improving real-world performance for larger graphs.</li>
|
|
|
- <li><a href="libs/graph/doc/read_graphviz.html"><code>read_graphviz</code></a> now has a new, Spirit-based parser that works for all graph types and supports arbitrary properties on the graph, from Ron Garcia. The old, Bison-based GraphViz reader has been deprecated and will be removed in a future Boost release.</li>
|
|
|
+ <li><a href="libs/graph/doc/read_graphviz.html"><code>read_graphviz</code></a> now has a new, Spirit-based parser that works for all graph types and supports arbitrary properties on the graph, from Ron Garcia. The old, Bison-based GraphViz reader has been deprecated and will be removed in a future Boost release. <a href="libs/graph/doc/write-graphviz.html"><code>write_graphviz</code></a> also supports dynamic properties.</li>
|
|
|
<li>See the <a href="libs/graph/doc/history.html#by-version">history</a> for additional changes and bug fixes.</li>
|
|
|
</ul></li>
|
|
|
|