Examples of ptolemy.graph.analysis.strategy.FloydWarshallAllPairShortestPathStrategy

ptolemy.graph.analysis.strategy.FloydWarshallAllPairShortestPathStrategy

Computation of the all pair shortest path of a directed graph using the Floyd-Warshall algorithm. The result is in the form of two dimensional array (matrix). The first dimension is indexed by the source node label while the second one is indexed by the sink node label. In graphs that have multiple edges between two nodes obviously the edge with the minimum weight is being considered for the shortest path. The distance between a node and itself is being considered Double.MAX_VALUE, unless otherwise specified by a self edge for a cyclic graph. ((double[][])result())[i][i] would be the length of the shortest cycle that includes the node with label "i".

@see ptolemy.graph.analysis.AllPairShortestPathAnalysis @since Ptolemy II 4.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia @version $Id: FloydWarshallAllPairShortestPathStrategy.java,v 1.20 2007/12/06 18:29:41 cxh Exp $

     *  @param edgeLength A mapping between the graph edges and double values,
     *  which play the role of edge costs.
     *
     */
    public AllPairShortestPathAnalysis(Graph graph, ToDoubleMapping edgeLength) {
        super(new FloydWarshallAllPairShortestPathStrategy(graph, edgeLength));
    }

Examples of ptolemy.graph.analysis.strategy.FloydWarshallAllPairShortestPathStrategy

Related Classes of ptolemy.graph.analysis.strategy.FloydWarshallAllPairShortestPathStrategy