OK I see. However, the networks I am dealing with are relatively small, on average ~25 vertices and ~60 edges. I think l could try to write some code of my own to find the paths. Could you maybe show me some references for any available path finding algorithm?
Thanks a lot! Hu On Nov 2, 2013 5:45 AM, "Tiago de Paula Peixoto" <[email protected]> wrote: > On 11/02/2013 02:27 AM, hux wrote: > > Dear all, > > > > I am new to graph tools. I am trying to calculate the average path length > > (not the shortest) between any 2 given vertices. Which function should I > use > > for that? Also, I would like to create a list of all possible paths > between > > any 2 given vertices. > > > > Here I assume the edges are directed in both cases. > > > > So far I haven't found proper functions in the documentation for these > > calculations. I would appreciate any suggestions. > > There is no function in the library which computes this. The reason for > this is that typically the number of distinct paths grows very fast > (super-polynomially) with the size of the network. Hence even if you > write a fast algorithm for this (which can't be done), the result would > not even fit in memory. > > Cheers, > Tiago > > -- > Tiago de Paula Peixoto <[email protected]> > > > _______________________________________________ > graph-tool mailing list > [email protected] > http://lists.skewed.de/mailman/listinfo/graph-tool > >
_______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
