/**
* Copyright (C) 2012 Red Hat, Inc. (jdcasey@commonjava.org)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.commonjava.cartographer.graph.spi.neo4j.traverse;
import org.commonjava.cartographer.graph.model.GraphPathInfo;
import org.commonjava.cartographer.graph.spi.neo4j.model.Neo4jGraphPath;
import org.neo4j.graphdb.Node;
import org.neo4j.graphdb.Path;
import org.neo4j.graphdb.Relationship;
public class PathExistenceVisitor
extends AbstractTraverseVisitor
{
private final Node end;
private boolean found = false;
public PathExistenceVisitor( final Node end )
{
this.end = end;
}
public boolean isFound()
{
return found;
}
@Override
public boolean isEnabledFor( final Path path )
{
return !found;
}
@Override
public void includingChild( final Relationship child, final Neo4jGraphPath childPath,
final GraphPathInfo childPathInfo, final Path parentPath )
{
final Node end = child.getEndNode();
if ( this.end.getId() == end.getId() )
{
found = true;
}
}
}