The problem we are trying to solve is as follows: The figure below describes a section of a graph. D ----------*--------------- | | | B F ----------*-------*-------* C | | | | | | ------------------*-------* A E We want to achieve the following via traversal: 1. Avoid the sequence from A->B->C->D. 2. Still be able to traverse to D from A via other paths, if available (eg. A->E, E->F, F->B, B->C, and C->D) We would like to be able to represent this in a graph (BGL) in a manner that will allow algorithms (such as DSP, connected_components etc.) to not take the 'prohibited path' into account. Is there a way to disable a particular path via traversal? Thanks in advance, Rohit.