org.apache.maven.graph.effective.traverse.DependencyPathFinder Maven / Gradle / Ivy
package org.apache.maven.graph.effective.traverse;
import java.util.ArrayList;
import java.util.Collection;
import java.util.List;
import org.apache.maven.graph.common.ref.ArtifactRef;
import org.apache.maven.graph.common.ref.ProjectVersionRef;
import org.apache.maven.graph.effective.EProjectGraph;
import org.apache.maven.graph.effective.rel.DependencyRelationship;
import org.apache.maven.graph.effective.rel.ProjectRelationship;
import edu.uci.ics.jung.graph.DirectedGraph;
public class DependencyPathFinder
{
private final ArtifactRef target;
private final DirectedGraph> graph;
private final List> paths = new ArrayList>();
private final ProjectVersionRef root;
public DependencyPathFinder( final EProjectGraph graph, final ArtifactRef target )
{
this.graph = graph.getRawGraph();
this.root = graph.getRoot();
this.target = target;
}
public synchronized List> getPaths()
{
if ( paths.isEmpty() )
{
recurseToRoot( target, new ArrayList() );
}
return paths;
}
private void recurseToRoot( final ProjectVersionRef declaring, final List inPath )
{
final Collection> edges = graph.getInEdges( target.asProjectVersionRef() );
for ( final ProjectRelationship rel : edges )
{
if ( rel instanceof DependencyRelationship )
{
final ProjectVersionRef decl = rel.getDeclaring();
final List currentPath = new ArrayList( inPath );
currentPath.add( (DependencyRelationship) rel );
if ( decl.equals( root ) )
{
paths.add( currentPath );
}
else
{
recurseToRoot( decl, currentPath );
}
}
}
}
}