*/
private double _computeMCM(DirectedGraph graph, ToDoubleMapping edgeLength) {
CycleMeanAnalyzer cycleMean = new KarpCycleMeanStrategy(graph,
edgeLength);
double result = cycleMean.maximumCycleMean();
_delayCycle = cycleMean.cycle();
return result;
}
// computes the First Order Longest Path Matrix which is a matrix
// of longest distances from every node to every other node indexed