Package | Description |
---|---|
org.jvnet.maven.plugin.antrun |
Modifier and Type | Field and Description |
---|---|
DependencyGraph.Node |
DependencyGraph.Edge.dst
The module that is being dependent by another.
|
DependencyGraph.Node |
DependencyGraph.Edge.src
The module that depends on another.
|
Modifier and Type | Method and Description |
---|---|
DependencyGraph.Node |
DependencyGraph.getRoot()
Gets the root node.
|
DependencyGraph.Node |
DependencyGraph.toNode(org.apache.maven.artifact.Artifact a)
Gets the associated
DependencyGraph.Node , or null if none exists. |
Modifier and Type | Method and Description |
---|---|
java.util.Collection<DependencyGraph.Node> |
DependencyGraph.getAllNodes()
Returns all nodes in this graph.
|
java.util.List<DependencyGraph.Node> |
DependencyGraph.Node.getBackwardNodes(DependencyGraph g)
Gets the nodes that depend on the given node.
|
java.util.List<DependencyGraph.Node> |
DependencyGraph.Node.getForwardNodes(DependencyGraph g)
Gets the nodes that the given node depends on.
|
Modifier and Type | Method and Description |
---|---|
boolean |
DependencyGraph.contains(DependencyGraph.Node node)
Checks if the graph contains the given node.
|
DependencyGraph |
DependencyGraph.createSubGraph(DependencyGraph.Node root)
Creates a full subgraph rooted at the given node.
|
DependencyGraph |
DependencyGraph.createSubGraph(DependencyGraph.Node root,
java.util.Collection<DependencyGraph.Node> nodes)
Creates a sub-graph from the given set of nodes (which must be subset of
nodes in the current graph) with all edges { (u,v) | u \in nodes, v \in nodes }
|
DependencyGraph |
DependencyGraph.createSubGraph(DependencyGraph.Node node,
GraphVisitor visitor)
Visits the graph started at the given node, and creates a sub-graph
from visited nodes and edges.
|
boolean |
GraphVisitor.visit(DependencyGraph.Node node)
Visits a node.
|
boolean |
ScopeFilter.visit(DependencyGraph.Node node) |
boolean |
GraphVizVisualizer.visit(DependencyGraph.Node node) |
boolean |
PackagingFilter.visit(DependencyGraph.Node node) |
boolean |
GroupIdFilter.visit(DependencyGraph.Node node) |
boolean |
RemoveSpecificArtifactsFilter.visit(DependencyGraph.Node node) |
boolean |
ManifestEntryFilter.visit(DependencyGraph.Node node) |
boolean |
ExcludeArtifactsTransitivelyFilter.visit(DependencyGraph.Node node) |
boolean |
DefaultGraphVisitor.visit(DependencyGraph.Node node) |
Modifier and Type | Method and Description |
---|---|
DependencyGraph |
DependencyGraph.createSubGraph(DependencyGraph.Node root,
java.util.Collection<DependencyGraph.Node> nodes)
Creates a sub-graph from the given set of nodes (which must be subset of
nodes in the current graph) with all edges { (u,v) | u \in nodes, v \in nodes }
|
Constructor and Description |
---|
DependencyGraph.Edge(DependencyGraph g,
DependencyGraph.Node src,
DependencyGraph.Node dst,
java.lang.String scope,
boolean optional) |
Copyright © 2014. All Rights Reserved.