[Boost-users] To find a path between two vertices in a tree.

Subject: [Boost-users] To find a path between two vertices in a tree.
From: Nishchal Devnur (nishchal.devnur_at_[hidden])
Date: 2011-05-18 15:34:20

Hi,

I am looking for a implementation in boost that is efficient in finding a
path between two vertices in a given tree. I am right now using the
unidrected adjancency list to store the tree. Given a node u and node v I
would like to find the path between these two nodes in the tree. Any
suggestions is greatly appreciated !

Thanks,
Nishchal Devanur