V - The vertex type.public class DependencyGraph<V> extends Object
| Constructor and Description |
|---|
DependencyGraph(Class<V> verticeClazz) |
DependencyGraph(Class<V> verticeClazz,
org.jgrapht.Graph<V,DependencyEdge> resourceGraph) |
| Modifier and Type | Method and Description |
|---|---|
static DependencyGraphBuilder |
builder() |
boolean |
equals(Object other) |
DependencyGraph<V> |
findCyclicSubGraphByVertex(V sourceKey)
Identify all the cycles contained inside the graph.
|
DependencyGraph<V> |
findDependantsSubGraphByKey(V sourceKey)
Retrieve a sub graph of dependants based on a certain source requestable key.
|
DependencyGraph<V> |
findDependencySubGraphByRequestableKey(V sourceKey)
Retrieve a sub graph of dependency based on a certain source requestable key.
|
DependencyGraph<V> |
findIntersectionSubGraph(V sourceKey,
V targetKey)
Find the intersection between two sub-graphs generated based on a source requestable key and target requestable key.
|
Collection<DependencyEdge> |
getEdges() |
boolean |
hasDependency(V key) |
int |
hashCode() |
String |
toString() |
@Nonnull public static DependencyGraphBuilder builder()
@Nonnull public DependencyGraph<V> findCyclicSubGraphByVertex(@Nonnull V sourceKey)
sourceKey - The source requestable resource key used as start point.@Nonnull public DependencyGraph<V> findDependantsSubGraphByKey(@Nonnull V sourceKey)
sourceKey - The source requestable resource key used as start point.@Nonnull public DependencyGraph<V> findDependencySubGraphByRequestableKey(@Nonnull V sourceKey)
sourceKey - The source requestable key used as start point.@Nonnull public DependencyGraph<V> findIntersectionSubGraph(@Nonnull V sourceKey, @Nonnull V targetKey)
sourceKey - The source requestable key used as start point for the first sub-graph to compare.targetKey - The target requestable key used start point for the second sub-graph to compare.public Collection<DependencyEdge> getEdges()
public boolean hasDependency(V key)
Copyright © 2024 Atlassian. All rights reserved.