Boost logo

Boost :

From: Cromwell Enage (sponage_at_[hidden])
Date: 2004-01-23 14:59:09

I'm currently working on an algorithm with the
following characteristics:

1. The main inputs are a graph and a path of vertices
within it.
2. The algorithm removes certain edges from the graph
until the input path is the only simple path between
its end vertices.

Eventually I'll use it to implement random
"walkthrough mazes", as described in

Is anyone else interested in using this algorithm or
one like it on their own projects?

                              Cromwell Enage

Do you Yahoo!?
Yahoo! SiteBuilder - Free web site building tool. Try it!

Boost list run by bdawes at, gregod at, cpdaniel at, john at