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

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

82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
                           Vertex i,
                           Vertex j,
                           int maxLength )
    {
        Set workingSet = new HashSet();
        workingSet.add( new PathImpl( i ) );

        for ( int k = 0; k < maxLength; k++ )
        {
            Iterator workingPaths = workingSet.iterator();
            if ( !workingPaths.hasNext() )
            {
                break;
            }

            Set newWorkingSet = new HashSet();

            while ( workingPaths.hasNext() )
            {
                PathImpl workingPath = (PathImpl) workingPaths.next();

                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 );


                        newWorkingSet.add( path );

                        if ( path.getEnd() == j )
                        {
                            listener.notifyPath( path );
                        }
                    }
                }
View Full Code Here
157
158
159
160
161
162
163
164
165
166
167
        while ( outbounds.hasNext() )
        {
            Edge outbound = (Edge) outbounds.next();
            if ( graph.getTarget( outbound ) == j )
            {
                RC.add( new PathImpl( i, j, outbound ) );
            }
        }

        Iterator ks = graph.getVertices().iterator();
        while ( ks.hasNext() )
View Full Code Here
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
                             Set kjs )
    {
        Iterator ikPaths = iks.iterator();
        while ( ikPaths.hasNext() )
        {
            PathImpl ik = (PathImpl) ikPaths.next();

            Iterator kjPaths = kjs.iterator();
            while ( kjPaths.hasNext() )
            {
                PathImpl kj = (PathImpl) kjPaths.next();
                RC.add( ik.append( kj ) );
            }
        }
    }
View Full Code Here
TOP

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

  • org.codehaus.plexus.graph.algorithm.path.AllPaths
  • java.util.List
  • java.util.ArrayList
    • 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.