CGAL users discussion list

[lhtrang <>]

Hi all,

I have now a problem on finding shortest path between two vertices on the
surface graph of polyhedron. I tried to apply "the surface of polyhedron as
model of  the Boost graph" and then use Dijkstra algorithm but it doesn't
work. So someone please give any suggestion?

Thank you in advance.

Bests,
Trang



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Dijkstra-s-algorithm-on-surface-graph-of-a-polyheron-tp4656323.html
Sent from the cgal-discuss mailing list archive at Nabble.com.