Interface DependencyGraph<T>
-
- All Known Subinterfaces:
BuildDependencyGraph,BuildTypeDependencyGraph,TopBuildDependencyGraph
- All Known Implementing Classes:
BuildDependencyGraphImpl,BuildTypeDependencyGraphImpl,TopBuildDependencyGraphImpl
public interface DependencyGraph<T>
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description booleancontains(T node)Returns true if node is part of this graph.Collection<T>getNodes()Map<String,T>getNodesMap()intgetNumberOfNodes()Returns number of nodes in this graph.TgetTop()Returns top node of the graph.voidtraverseBottomUp(ItemProcessor<T> nodesProcessor)Traverse dependency graph from bottom to topvoidtraverseTopDown(ItemProcessor<T> nodesProcessor)Traverse dependency graph from top to bottom
-
-
-
Method Detail
-
traverseBottomUp
void traverseBottomUp(@NotNull ItemProcessor<T> nodesProcessor)Traverse dependency graph from bottom to top- Parameters:
nodesProcessor- item processor
-
traverseTopDown
void traverseTopDown(@NotNull ItemProcessor<T> nodesProcessor)Traverse dependency graph from top to bottom- Parameters:
nodesProcessor- item processor
-
getNumberOfNodes
int getNumberOfNodes()
Returns number of nodes in this graph.- Returns:
- number of nodes in this graph.
-
getTop
T getTop()
Returns top node of the graph.- Returns:
- the graph top node.
-
contains
boolean contains(@NotNull T node)Returns true if node is part of this graph.- Parameters:
node- graph node- Returns:
- see above
- Since:
- 6.0
-
getNodes
@NotNull Collection<T> getNodes()
- Returns:
- all of the graph nodes, including the top node itself
-
-