[jgrapht-users] Average path length

[Claudio M. <cla...@gm...>]

Hello list!

I'm trying to calculate the average path length of my graph and the
diameter (longest shortest path).

At the moment it's non-optimized:

for(Vertex source: graph.vertexSet()){
    for(Vertex destination: graph.vertexSet()){
        if(!source.equals(destination)){
            List<DefaultWeightedEdge> path =
DijkstraShortestPath.findPathBetween(graph, source, destination);
            if(path != null)
                averagePathLength += path.size();
        }
    }
}
N = graph.vertexSet().size();
averagePathLength /= (N*(N-1));

This code is simplified to explain you what I'm doing now. There's of
course a misusage of resources and computational time. Any idea what
is the best way to calculate average path lengths, diameter and every
kind of graph property that would need to calculate paths reusing
resources and partial solutions?

TIA

/CM


-- 
    Claudio Martella
    cla...@gm...