Package org.codehaus.plexus.graph.algorithm.util

Examples of org.codehaus.plexus.graph.algorithm.util.Label

99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
    }

    protected boolean connectsLabels( Graph graph,
                                      Edge e )
    {
        Label first = null;
        Label second = null;

        Iterator vertices = graph.getVertices( e ).iterator();
        if ( vertices.hasNext() )
        {
            first = findLabel( (Vertex) vertices.next() );
        }
        else
        {
            return false;
        }

        if ( vertices.hasNext() )
        {
            second = findLabel( (Vertex) vertices.next() );
        }
        else
        {
            return false;
        }

        if ( vertices.hasNext() )
        {
            throw new HyperGraphException( "Unable to compute MSF on Hypergraph." );
        }

        return !first.getRoot().equals( second.getRoot() );
    }
View Full Code Here
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
                            Edge edge )
    {
        addEdge( edge );
        chords.remove( edge );
        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 );
        }

        setWeight( edge, graph.getWeight( edge ) );
View Full Code Here
178
179
180
181
182
183
184
185
186
187
188
        // 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.
        while ( !queue.isEmpty() )
View Full Code Here
TOP

Related Classes of org.codehaus.plexus.graph.algorithm.util.Label

  • org.codehaus.plexus.graph.algorithm.spanning.MinimumSpanningForest
    • 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.