Package org.codehaus.plexus.graph

Examples of org.codehaus.plexus.graph.Edge

83
84
85
86
87
88
89
90
91
92
93
        visitor.discoverVertex( v );

        Iterator edges = graph.getOutbound( v ).iterator();
        while ( edges.hasNext() )
        {
            Edge e = (Edge) edges.next();
            visitEdge( graph, e, visitor );
        }

        visitor.finishVertex( v );
View Full Code Here
169
170
171
172
173
174
175
176
177
178
179
        visitor.discoverVertex( vertex );
        Iterator edges = graph.getEdges( vertex ).iterator();
        while ( edges.hasNext() )
        {
            Edge edge = (Edge) edges.next();

            double edgeCost = graph.getWeight( edge );
            ComparableEdge wEdge = new ComparableEdge( edge, edgeCost + cost );
            tasks.insert( wEdge );
        }
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
            }

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

                RC.addEdge( edge, getTarget( edge ), getSource( edge ) );
            }

            return RC;
View Full Code Here
187
188
189
190
191
192
193
194
195
196
197
        pw.println( "<EDGESET>" );

        Iterator edges = graph.getEdges().iterator();
        while ( edges.hasNext() )
        {
            Edge next = (Edge) edges.next();

            int length = new Double( lengthFactor * defaultLength ).intValue();

            if ( graph instanceof WeightedGraph )
            {
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
        visitor.discoverVertex( v );

        Iterator edges = graph.getOutbound( v ).iterator();
        while ( edges.hasNext() )
        {
            Edge e = (Edge) edges.next();
            visitEdge( graph, e, visitor );
        }

        visitor.finishVertex( v );
View Full Code Here
185
186
187
188
189
190
191
192
193
194
195
        }

        // Bring the edges out in the right order.
        while ( !queue.isEmpty() )
        {
            Edge e = (Edge) queue.pop();

            if ( connectsLabels( graph, e ) )
            {
                addEdge( graph, e );
            }
View Full Code Here
169
170
171
172
173
174
175
176
177
178
179
        visitor.discoverVertex( vertex );
        Iterator edges = graph.getEdges( vertex ).iterator();
        while ( edges.hasNext() )
        {
            Edge edge = (Edge) edges.next();

            double edgeCost = graph.getWeight( edge );
            ComparableEdge wEdge = new ComparableEdge( edge, edgeCost + cost );
            tasks.insert( wEdge );
        }
View Full Code Here
272
273
274
275
276
277
278
279
280
281
282
            // First round values need to be in the matrix.
            Iterator edgeSet = graph.getOutbound( vArray[i] ).iterator();
            while ( edgeSet.hasNext() )
            {
                Edge e = (Edge) edgeSet.next();
                int j = index( graph.getTarget( e ) );
                pred[i][j] = i;
                if ( graph instanceof WeightedGraph )
                {
                    cost[i][j] = ( (WeightedGraph) graph ).getWeight( e );
View Full Code Here
78
79
80
81
82
83
84
85
86
87
88
        }

        /** Description of the Method */
        public Object get( int index )
        {
            Edge RC = null;

            Vertex source = (Vertex) vertices.get( index );
            Vertex target = (Vertex) vertices.get( index + 1 );

            Set outboundSet = graph.getOutbound( source );
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
                Iterator outbound = graph.getOutbound( workingPath.getEnd() ).iterator();

                while ( outbound.hasNext() )
                {
                    Edge obEdge = (Edge) outbound.next();
                    if ( apsp.hasPath( graph.getTarget( obEdge ), j ) )
                    {

                        PathImpl path = workingPath.append( graph.getTarget( obEdge ), obEdge );
View Full Code Here
TOP

Related Classes of org.codehaus.plexus.graph.Edge

  • org.codehaus.plexus.graph.algorithm.path.AllPairsShortestPath
  • org.codehaus.plexus.graph.algorithm.path.AllPairsShortestPath$EdgeList
  • org.codehaus.plexus.graph.algorithm.path.AllPaths
  • org.codehaus.plexus.graph.algorithm.search.CostSearch
  • org.codehaus.plexus.graph.algorithm.search.DFS
  • org.codehaus.plexus.graph.algorithm.spanning.MinimumSpanningForest
  • org.codehaus.plexus.graph.decorator.DDirectedGraph
  • org.codehaus.plexus.graph.domain.basic.DefaultDirectedGraph
  • org.codehaus.plexus.graph.search.CostSearch
  • org.codehaus.plexus.graph.search.DFS
    • Copyright © 2018 www.massapicom. All rights reserved.
    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.