Hi!
I have a rather large graph::Graph object and would like to compute the shortest path between two nodes. I noticed that there seem to be (at least C++-side) implementations of shortest-path algorithms in application graph. However, I'm not quite sure how to use them. My guess is there isn't any perl-side-glueing at the moment? So is there any way to use this yet? Including any of the shortest_path_ headers does not work without further meddling, since they're not in the usr/local/include/polymake/graph/ folder. Hence I'm not sure if I'm supposed to be using them at all or if this is maybe still in development...
