List of predecessorEdges() Examples

Examples of predecessorEdges()

ptolemy.graph.DirectedGraph.predecessorEdges()
Return the collection of edges that make a node n2 a predecessor of a node n1. In other words, return the collection of edges directed from n2 to n1. Each element of the collection is an {@link Edge}. @param n1 The node n1. @param n2 The node n2. @return The collection of edges that make n2 a predecessor of n1. @see DirectedGraph#successorEdges(Node,Node) @see Graph#neighborEdges(Node,Node)

Examples of ptolemy.graph.DirectedGraph.predecessorEdges()

                for (Iterator successorNodes = successors.iterator(); successorNodes
                        .hasNext();) {
                    Node v = (Node) successorNodes.next();
                    double predecessorDistance = distance[graph().nodeLabel(u)];
                    double actualDistance = distance[graph().nodeLabel(v)];
                    Collection edgeCollection = graph.predecessorEdges(v, u);
                    Iterator edges = edgeCollection.iterator();
                    double connectingEdgeCost = -Double.MAX_VALUE;


                    while (edges.hasNext()) {
                        Edge edge = (Edge) edges.next();

View Full Code Here

Examples of ptolemy.graph.DirectedGraph.predecessorEdges()

    //    }
    // Return the length of edge with maximum/minimum length between
    // the two nodes.
    private double _getCost(Node u, Node v) {
        DirectedGraph directedCyclicGraph = (DirectedGraph) graph();
        Collection edgeCollection = directedCyclicGraph.predecessorEdges(v, u);
        Iterator edges = edgeCollection.iterator();
        double weight = -Double.MAX_VALUE;


        if (!_maximumAnalysis) {
            weight = Double.MAX_VALUE;

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.