Package org.codehaus.plexus.util.dag

Examples of org.codehaus.plexus.util.dag.DAG.addEdge()

45
46
47
48
49
50
51
52
53
54
55
                dag.addVertex( creator.getId() );

                for ( String depId : creator.getCreatorDependencies() )
                {
                    dag.addEdge( creator.getId(), depId );
                }
            }

            List<String> sortedIds = TopologicalSorter.sort( dag );
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
                String dependencyId = getDependencyId( dependency );

                if ( dag.getVertex( dependencyId ) != null )
                {
                    dag.addEdge( id, dependencyId );
                }
            }

            // Parent
            ProjectDependency parent = project.getParent();
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
                    // Parent is added as an edge, but must not cause a cycle - so we remove any other edges it has in conflict
                    if ( dag.hasEdge( parentId, id ) )
                    {
                        dag.removeEdge( parentId, id );
                    }
                    dag.addEdge( id, parentId );
                }
            }
        }

        List<Project> sortedProjects = new ArrayList<Project>();
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
                if ( dag.getVertex( dependencyId ) != null )
                {
                    try
                    {
                        dag.addEdge( id, dependencyId );
                    }
                    catch ( CycleDetectedException e )
                    {
                        logger.warn( "Ignore cycle detected in project dependencies: " + e.getMessage() );
                    }
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
                    {
                        dag.removeEdge( parentId, id );
                    }
                    try
                    {
                        dag.addEdge( id, parentId );
                    }
                    catch ( CycleDetectedException e )
                    {
                        logger.warn( "Ignore cycle detected in project parent: " + e.getMessage() );
                    }
View Full Code Here
138
139
140
141
142
143
144
145
146
147
148
        // resolve dependencies which have class defs to primary class name
        ClassDef dep = allClasses.get(name);
        if (dep != null) {
          name = dep.getName();
        }
        graph.addEdge(def.getName(), name);
      }
    }

    // display some debug information about the graph
    if (debug) {
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
                if ( dag.getVertex( dependencyId ) != null )
                {
                    try
                    {
                        dag.addEdge( id, dependencyId );
                    }
                    catch ( CycleDetectedException e )
                    {
                        logger.warn( "Ignore cycle detected in project dependencies: " + e.getMessage() );
                    }
View Full Code Here
116
117
118
119
120
121
122
123
124
125
126
                    {
                        dag.removeEdge( parentId, id );
                    }
                    try
                    {
                        dag.addEdge( id, parentId );
                    }
                    catch ( CycleDetectedException e )
                    {
                        logger.warn( "Ignore cycle detected in project parent: " + e.getMessage() );
                    }
View Full Code Here
88
89
90
91
92
93
94
95
96
97
98
                String dependencyId = getDependencyId( dependency );

                if ( dag.getVertex( dependencyId ) != null )
                {
                    dag.addEdge( id, dependencyId );
                }
            }

            // Parent
            ProjectDependency parent = project.getParent();
View Full Code Here
106
107
108
109
110
111
112
113
114
115
116
                    // Parent is added as an edge, but must not cause a cycle - so we remove any other edges it has in conflict
                    if ( dag.hasEdge( parentId, id ) )
                    {
                        dag.removeEdge( parentId, id );
                    }
                    dag.addEdge( id, parentId );
                }
            }
        }

        List<Project> sortedProjects = new ArrayList<Project>();
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.