## Uses of Class
org.jvnet.maven.plugin.antrun.DependencyGraph.Node

Packages that use DependencyGraph.Node
org.jvnet.maven.plugin.antrun

Uses of DependencyGraph.Node in org.jvnet.maven.plugin.antrun

Fields in org.jvnet.maven.plugin.antrun declared as DependencyGraph.Node
`DependencyGraph.Node` `DependencyGraph.Edge.dst` The module that is being dependent by another.
`DependencyGraph.Node` `DependencyGraph.Edge.src` The module that depends on another.

Methods in org.jvnet.maven.plugin.antrun that return DependencyGraph.Node
`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.

Methods in org.jvnet.maven.plugin.antrun that return types with arguments of type DependencyGraph.Node
`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.

Methods in org.jvnet.maven.plugin.antrun with parameters of type DependencyGraph.Node
`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` `RemoveSpecificArtifactsFilter.visit(DependencyGraph.Node node)`
`boolean` `ManifestEntryFilter.visit(DependencyGraph.Node node)`
`boolean` `ExcludeArtifactsTransitivelyFilter.visit(DependencyGraph.Node node)`
`boolean` `ScopeFilter.visit(DependencyGraph.Node node)`
`boolean` `PackagingFilter.visit(DependencyGraph.Node node)`
`boolean` `GroupIdFilter.visit(DependencyGraph.Node node)`
`boolean` `GraphVizVisualizer.visit(DependencyGraph.Node node)`
`boolean` `DefaultGraphVisitor.visit(DependencyGraph.Node node)`
`boolean` `GraphVisitor.visit(DependencyGraph.Node node)` Visits a node.

Method parameters in org.jvnet.maven.plugin.antrun with type arguments of type DependencyGraph.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 }

Constructors in org.jvnet.maven.plugin.antrun with parameters of type DependencyGraph.Node
`DependencyGraph.Edge(DependencyGraph g, DependencyGraph.Node src, DependencyGraph.Node dst, java.lang.String scope, boolean optional)`

Copyright © 2011. All Rights Reserved.