Package org.codehaus.plexus.graph

Examples of org.codehaus.plexus.graph.Vertex

61
62
63
64
65
66
67
68
69
70
71
                            Edge e,
                            Visitor visitor )
    {
        visitor.discoverEdge( e );

        Vertex v = graph.getTarget( e );

        if ( getColor( v ) == WHITE )
        {
            visitVertex( graph, v, visitor );
        }
View Full Code Here
115
116
117
118
119
120
121
122
123
124
125
        visitor.discoverGraph( graph );

        Iterator vertices = graph.getVertices().iterator();
        while ( vertices.hasNext() )
        {
            Vertex v = (Vertex) vertices.next();

            if ( colors.get( v ) == WHITE )
            {
                visitVertex( graph, v, visitor );
            }
View Full Code Here
192
193
194
195
196
197
198
199
200
201
202
        visitor.discoverEdge( e );

        Iterator vertices = graph.getVertices( e ).iterator();
        while ( vertices.hasNext() )
        {
            Vertex v = (Vertex) vertices.next();
            if ( colors.get( v ) == WHITE )
            {
                visitVertex( graph, v, cost, visitor );
            }
        }
View Full Code Here
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
    {
        pw.println( "<NODESET>" );
        Iterator vertices = graph.getVertices().iterator();
        while ( vertices.hasNext() )
        {
            Vertex v = (Vertex) vertices.next();

            pw.println( "<NODE nodeID=\"" + v.toString() + "\">" );
            pw.println( "<NODE_LOCATION x=\"" + random.nextInt( 200 ) + "\" y = \"" + random.nextInt( 200 ) +
                "\" visible=\"true\" />" );

            String label;
            if ( v instanceof Named )
            {
                label = ( (Named) v ).getName();
            }
            else
            {
                label = v.toString();
            }

            String backColor = null;
            String textColor = null;
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
                            Edge e,
                            Visitor visitor )
    {
        visitor.discoverEdge( e );

        Vertex v = graph.getTarget( e );

        if ( colors.get( v ) == WHITE )
        {
            visitVertex( graph, v, visitor );
        }
View Full Code Here
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
        Iterator vertices = graph.getVertices( edge ).iterator();
        Label prime = null;

        if ( vertices.hasNext() )
        {
            Vertex p = (Vertex) vertices.next();
            prime = findLabel( p );

            connect( edge, p );
        }

        while ( vertices.hasNext() )
        {
            Vertex v = (Vertex) vertices.next();

            Label l = findLabel( v );
            l.setRoot( prime );

            connect( edge, v );
View Full Code Here
177
178
179
180
181
182
183
184
185
186
187
        // Fill the graph we have with all the Vertexes.
        Iterator vertices = graph.getVertices().iterator();
        while ( vertices.hasNext() )
        {
            Vertex v = (Vertex) vertices.next();
            labels.put( v, new Label() );
            addVertex( v );
        }

        // Bring the edges out in the right order.
View Full Code Here
192
193
194
195
196
197
198
199
200
201
202
        visitor.discoverEdge( e );

        Iterator vertices = graph.getVertices( e ).iterator();
        while ( vertices.hasNext() )
        {
            Vertex v = (Vertex) vertices.next();
            if ( colors.get( v ) == WHITE )
            {
                visitVertex( graph, v, cost, visitor );
            }
        }
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
                                    DataFlowEquations eq )
    {
        Iterator vertices = graph.getVertices().iterator();
        while ( vertices.hasNext() )
        {
            Vertex v = (Vertex) vertices.next();
            inValues.put( v, new BitSet() );   // Initialize everything to
            outValues.put( v, new BitSet() );  // empty
        }

        boolean isOK = true;
        while ( isOK )
        {
            vertices = graph.getVertices().iterator();
            isOK = false;
            while ( vertices.hasNext() )
            {
                Vertex v = (Vertex) vertices.next();

                BitSet out = new BitSet();
                out.or( (BitSet) inValues.get( v ) );
                out.or( eq.generates( v ) );
                out.andNot( eq.kills( v ) );

                /*
            System.err.println("Old Out: " + v + ":" + outValues.get( v ));
            System.err.println("New Out: " + v + ":" + out);
            */
                if ( !out.equals( outValues.get( v ) ) )
                {
                    isOK = true;
                    outValues.put( v, out );

                    Iterator outbound = graph.getOutbound( v ).iterator();
                    while ( outbound.hasNext() )
                    {
                        Vertex target = graph.getTarget( (Edge) outbound.next() );

                        BitSet in = (BitSet) inValues.get( target );
                        in.or( out );
                        inValues.put( target, in );
                        /*
 
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
        /** 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 );
            if ( outboundSet == null )
            {
                return null;
View Full Code Here
TOP

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

  • org.codehaus.plexus.graph.algorithm.dataflow.DataFlowSolutions
  • 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.domain.basic.DefaultDirectedGraph
  • org.codehaus.plexus.graph.search.CostSearch
  • org.codehaus.plexus.graph.search.DFS
  • org.codehaus.plexus.graph.visualize.TouchGraph
    • 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.