Changeset 46561

Timestamp:

Jun 20, 2008, 3:27:55 PM (14 years ago)

Author:

Andrew Sutton

Message:

Rewriting some of the add-edge protocol and types for directed graphs to help
better support constant edge deletions. This is done by making the out
descriptor wrap an iterator (const or otherwise) into the out edge list.
Since that gets piggy-backed around by edge descriptors, we can do a
pretty good job removing vertices. This adds a lot of const-based grossness,
however.

Added a couple of missing files.

(No files)