CGAL users discussion list

[Philipp Moeller <>]

lhtrang 
<>
 writes:

> 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?

What doesn't work? Does it not compile? Doesn't produce the right output?

Please show the code that you are trying and the CGAL and Boost version
which you are using. Also show the relevant parts of the error
message. Otherwise there is no way to help.