/** * Indicates if there is at least one edge leading to or from vertex of given label * * @return <code>true</code> if this vertex is connected with other vertex,<code>false</code> otherwise */ public boolean isConnected( final String label ) { final Vertex vertex = getVertex( label ); final boolean retValue = vertex.isConnected(); return retValue; }
/** * @param label * @return */ public List<String> getParentLabels( final String label ) { final Vertex vertex = getVertex( label ); return vertex.getParentLabels(); }
/** * @param label * @return */ public List<String> getChildLabels( final String label ) { final Vertex vertex = getVertex( label ); return vertex.getChildLabels(); }
/** * Return the list of labels of successor in order decided by topological sort * * @param label The label of the vertex whose predecessors are searched * @return The list of labels. Returned list contains also the label passed as parameter to this method. This label * should always be the last item in the list. */ public List<String> getSuccessorLabels( final String label ) { final Vertex vertex = getVertex( label ); final List<String> retValue; // optimization. if ( vertex.isLeaf() ) { retValue = new ArrayList<String>( 1 ); retValue.add( label ); } else { retValue = TopologicalSorter.sort( vertex ); } return retValue; }
Vertex v = dag.getVertex( id ); if ( make )
if ( dag.getVertex( id ) != null ) .versionlessKey( dependency.getGroupId(), dependency.getArtifactId() ); if ( dag.getVertex( dependencyId ) != null ) if ( dag.getVertex( parentId ) != null ) if ( dag.getVertex( pluginId ) != null && !pluginId.equals( id ) ) .versionlessKey( dependency.getGroupId(), dependency.getArtifactId() ); if ( dag.getVertex( dependencyId ) != null ) if ( dag.getVertex( pluginId ) != null && !pluginId.equals( id ) ) if ( dag.getVertex( extensionId ) != null )