I was wondering how the all_shortest_paths function was defined.
I have a large network (“g”). In that network there are two nodes (“source” and “target”, say) for which I am interested as to how they interconnect. From prior research I know that there is at least one set of connections between them. I have verified that this path actually exists in the network manually as far as I can tell.
When I however run all_shortest_paths(g,source,target) this path is not part of the results set. Why is that? Does all_shortest_paths stop searching after it has found a certain number of results? If so, is it possible to change this cut-off criterion?
Finally, is it possible to also obtain an edge descriptor as a result? Currently I think the documentation states that the result is an iterator over the sequence of vertices from source to target.