Polish up code/docs for pending items and champion the formal
review. The pending items are:
container_traits.hpp
concept_checks.hpp
property.hpp
The queues and heaps: queue.hpp,
mutable_queue.hpp, fibonacci_heap.hpp.
Somehow merge implementation with Dietmer's heaps and queues.
iterator_adaptor.hpp (need to figure out
why this causes problems for VC++)
disjoint_sets
Port the graph library to Borland C++
Port the graph library to Metrowerks C++
Construct a set of planar graph algorithms.
Is the graph planar?
"Walk around the block" and similar open and closed neighborhood
traversals. Note that edge traversals need to resolve to particular ends
and sides (see below), not just to the edge as a whole.
Given a point, find the nearest vertex, edge, or bounded polygon.
Again, edges are viewed as having left and right sides.
Given a line segment, find intersecting vertices, edges, or bounded
polygons.
Given a polygon, find intersecting whatever...
Various minimum bounding rectangle and clipping problems.
Construct a planar embedding of a planar graph.
Find a balanced separator of a graph.
Finish and test Maximum Flow algorithm.
Create an adjacency_matrix class that models
the AdjacencyMatrix
concept.
Floyd-Warshall algorithm.
Rewrite the Qhull algorithm using the Boost Graph Library.
Explore the use of Algorithm Objects as an alternative to
the current approach with visitors.
Analyze the algorithms that do not yet have visitors, and
come up with visitor interfaces for them.
Add a check in the adjacency_list class to make sure
all the vertex property template arguments have kind=vertex_property_tag
and all edge property template arguments have kind=edge_property_tag
