All: I am trying to use igraph to find the shortest path in a directed weighted graph. I don't see how to specify the edge weights though. I see quite well that I should pass "const igraph_vector_t *weights" to the shortest paths function (in this case "igraph_get_shortest_paths_dijkstra") but the documentation doesn't describe how to construct such a vector so that igraph understands it (or, at least the docs available at http://igraph.sourceforge.net/doc/html/). The contents of the result vector are described poorly as well. It apparently contains more vectors... which contain? And if it contains the path, how do I know which edges were used?
-Ryan Kelly