Hi,
Dear all,
I am working on Partially Directed Graph (PDAG). For direction i am using weight property. Now i want to find is there any path between given two nodes A and C ?
Can any one guide me how i can do this using BOOST Graph libraries.
I find transitive_closure property but please guide me how i can tackle this method using VC++.
Thanks in advance