Graph filtering

Topics: algorithm
Mar 2, 2011 at 4:53 PM

I'm looking to find an optimal way to remove some vertexes and readjust edges appropriately.

a simple example would be:

a->b->C->d->E->f

i would like to remove capital letters and have as a result:

a->b->d->f

I assume

FilteredVertexAndEdgeListGraph will create

a->b, d, f

Any help will be greatly appreciated.