org.neo4j.graphdb.Node.traverse()方法的使用及代码示例

x33g5p2x  于2022-01-24 转载在 其他  
字(8.9k)|赞(0)|评价(0)|浏览(116)

本文整理了Java中org.neo4j.graphdb.Node.traverse()方法的一些代码示例，展示了Node.traverse()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。Node.traverse()方法的具体详情如下：
包路径：org.neo4j.graphdb.Node
类名称：Node
方法名：traverse

Node.traverse介绍

暂无

代码示例

代码示例来源：origin: neo4j-contrib/graph-collections

Iterable<Node> getAllTimeNodes()
{
  return underlyingNode.traverse( Order.DEPTH_FIRST,
      StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator()
      {
        public boolean isReturnableNode( TraversalPosition position )
        {
          return position.depth() > 0;
        }
      }, RelTypes.TIMELINE_NEXT_ENTRY, Direction.OUTGOING );
}

代码示例来源：origin: org.neo4j/neo4j-graph-collections

Iterable<Node> getAllTimeNodes()
{
  return underlyingNode.traverse( Order.DEPTH_FIRST,
      StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator()
      {
        public boolean isReturnableNode( TraversalPosition position )
        {
          return position.depth() > 0;
        }
      }, RelTypes.TIMELINE_NEXT_ENTRY, Direction.OUTGOING );
}

代码示例来源：origin: neo4j-contrib/graph-collections

public Iterable<Node> getAllNodes()
{
  return underlyingNode.traverse(
      Order.BREADTH_FIRST,
      StopEvaluator.END_OF_GRAPH,
      new ReturnableEvaluator()
      {
        public boolean isReturnableNode( TraversalPosition position )
        {
          Relationship last = position.lastRelationshipTraversed();
          if ( last != null
             && last.isType(
                 RelTypes.TIMELINE_INSTANCE ) )
          {
            return true;
          }
          return false;
        }
      }, RelTypes.TIMELINE_INSTANCE, Direction.OUTGOING,
      RelTypes.TIMELINE_NEXT_ENTRY, Direction.OUTGOING );
}

代码示例来源：origin: org.neo4j/neo4j-graph-collections

public Iterable<Node> getAllNodes()
{
  return underlyingNode.traverse(
      Order.BREADTH_FIRST,
      StopEvaluator.END_OF_GRAPH,
      new ReturnableEvaluator()
      {
        public boolean isReturnableNode( TraversalPosition position )
        {
          Relationship last = position.lastRelationshipTraversed();
          if ( last != null
             && last.getType().equals(
                 RelTypes.TIMELINE_INSTANCE ) )
          {
            return true;
          }
          return false;
        }
      }, RelTypes.TIMELINE_INSTANCE, Direction.OUTGOING,
      RelTypes.TIMELINE_NEXT_ENTRY, Direction.OUTGOING );
}

代码示例来源：origin: neo4j-contrib/graph-collections

public Iterable<Node> getAllNodesBefore( final long timestamp )
  return underlyingNode.traverse( Order.DEPTH_FIRST, new StopEvaluator()

代码示例来源：origin: org.neo4j/neo4j-graph-collections

public Iterable<Node> getAllNodesBefore( final long timestamp )
  return underlyingNode.traverse( Order.DEPTH_FIRST, new StopEvaluator()

代码示例来源：origin: org.neo4j/neo4j-graph-collections

public Iterable<Node> getAllIndexInternalNodes() {
  return getIndexRoot().traverse(Order.BREADTH_FIRST, StopEvaluator.END_OF_GRAPH, ReturnableEvaluator.ALL_BUT_START_NODE,
      RTreeRelationshipTypes.RTREE_CHILD, Direction.OUTGOING);
}

代码示例来源：origin: org.neo4j/neo4j-graph-collections

private void checkGeometryNodeIterator() {
  while ((geometryNodeIterator == null || !geometryNodeIterator.hasNext()) && allIndexNodeIterator.hasNext()) {
    geometryNodeIterator = allIndexNodeIterator.next().traverse(Order.DEPTH_FIRST, StopEvaluator.DEPTH_ONE,
        ReturnableEvaluator.ALL_BUT_START_NODE, RTreeRelationshipTypes.RTREE_REFERENCE, Direction.OUTGOING)
        .iterator();
  }
}

代码示例来源：origin: neo4j-contrib/graph-collections

private void checkGeometryNodeIterator() {
  while ((geometryNodeIterator == null || !geometryNodeIterator.hasNext()) && allIndexNodeIterator.hasNext()) {
    geometryNodeIterator = allIndexNodeIterator.next().traverse(Order.DEPTH_FIRST, StopEvaluator.DEPTH_ONE,
        ReturnableEvaluator.ALL_BUT_START_NODE, RTreeRelationshipTypes.RTREE_REFERENCE, Direction.OUTGOING)
        .iterator();
  }
}

代码示例来源：origin: neo4j-contrib/graph-collections

public Iterable<Node> getAllIndexInternalNodes() {
  return getIndexRoot().traverse(Order.BREADTH_FIRST, StopEvaluator.END_OF_GRAPH, ReturnableEvaluator.ALL_BUT_START_NODE,
      RTreeRelationshipTypes.RTREE_CHILD, Direction.OUTGOING);
}

代码示例来源：origin: org.neo4j/neo4j-utils

public Iterator<Node> iterate()
  {
    StopEvaluator stopEvaluator = new StopEvaluator()
    {
      public boolean isStopNode( TraversalPosition pos )
      {
        return pos.lastRelationshipTraversed() != null &&
          pos.currentNode().equals( rootNode );
      }
    };
    
    Traverser traverser = rootNode.traverse( Order.BREADTH_FIRST,
      stopEvaluator, ReturnableEvaluator.ALL_BUT_START_NODE, relType,
      Direction.OUTGOING );
    return traverser.iterator();
  }
}

代码示例来源：origin: org.neo4j/neo4j-graph-collections

public SearchResults searchIndex(SearchFilter filter) {
  // TODO: Refactor to new traversal API
  SearchEvaluator searchEvaluator = new SearchEvaluator(filter);
  return new SearchResults(getIndexRoot().traverse(Order.DEPTH_FIRST, searchEvaluator, searchEvaluator,
      RTreeRelationshipTypes.RTREE_CHILD, Direction.OUTGOING, RTreeRelationshipTypes.RTREE_REFERENCE, Direction.OUTGOING));
}

代码示例来源：origin: neo4j-contrib/graph-collections

public SearchResults searchIndex(SearchFilter filter) {
  // TODO: Refactor to new traversal API
  SearchEvaluator searchEvaluator = new SearchEvaluator(filter);
  return new SearchResults(getIndexRoot().traverse(Order.DEPTH_FIRST, searchEvaluator, searchEvaluator,
      RTreeRelationshipTypes.RTREE_CHILD, Direction.OUTGOING, RTreeRelationshipTypes.RTREE_REFERENCE, Direction.OUTGOING));
}

代码示例来源：origin: org.neo4j/neo4j-graph-collections

/**
 * Returns all the entries in this b-tree. The iterable returned back is
 * a wrapped {@link Traverser}.
 * 
 * @return an Iterable of all the entries in this b-tree
 */
public Iterable<KeyEntry> entries()
{
  EntryReturnableEvaluator entryEvaluator = 
    new EntryReturnableEvaluator();
  
  Traverser trav = treeRoot.getUnderlyingNode().traverse( 
    Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, 
    entryEvaluator, RelTypes.KEY_ENTRY, Direction.OUTGOING, 
    RelTypes.SUB_TREE, Direction.OUTGOING );
  return new EntryTraverser( trav, this, entryEvaluator );
}

代码示例来源：origin: neo4j-contrib/graph-collections

/**
 * Returns all the entries in this b-tree. The iterable returned back is
 * a wrapped {@link Traverser}.
 * 
 * @return an Iterable of all the entries in this b-tree
 */
public Iterable<KeyEntry> entries()
{
  EntryReturnableEvaluator entryEvaluator = 
    new EntryReturnableEvaluator();
  
  Traverser trav = treeRoot.getUnderlyingNode().traverse( 
    Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, 
    entryEvaluator, RelTypes.KEY_ENTRY, Direction.OUTGOING, 
    RelTypes.SUB_TREE, Direction.OUTGOING );
  return new EntryTraverser( trav, this, entryEvaluator );
}

代码示例来源：origin: neo4j-contrib/graph-collections

/**
 * Returns the values of all entries in this b-tree. The iterable which is
 * returned back is wrapped {@link Traverser}.
 * 
 * @return the values of all entries values in this b-tree.
 */
public Iterable<Object> values()
{
  Traverser trav = getTreeRoot().getUnderlyingNode().traverse( 
    Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, 
    new ReturnableEvaluator()
    {
      public boolean isReturnableNode( TraversalPosition pos )
      {
        Relationship last = pos.lastRelationshipTraversed();
        if ( last != null && last.getType().equals( 
          RelTypes.KEY_ENTRY ) )
        {
          return true;
        }
        return false;
      }
    }, RelTypes.KEY_ENTRY, Direction.OUTGOING, 
    RelTypes.SUB_TREE, Direction.OUTGOING );
  return new ValueTraverser( trav );
}

代码示例来源：origin: neo4j-contrib/graph-collections

try
  Traverser traverser = node.traverse( Traverser.Order.DEPTH_FIRST,
      StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator()

代码示例来源：origin: org.neo4j/neo4j-graph-collections

/**
 * Returns the values of all entries in this b-tree. The iterable which is
 * returned back is wrapped {@link Traverser}.
 * 
 * @return the values of all entries values in this b-tree.
 */
public Iterable<Object> values()
{
  Traverser trav = getTreeRoot().getUnderlyingNode().traverse( 
    Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, 
    new ReturnableEvaluator()
    {
      public boolean isReturnableNode( TraversalPosition pos )
      {
        Relationship last = pos.lastRelationshipTraversed();
        if ( last != null && last.getType().equals( 
          RelTypes.KEY_ENTRY ) )
        {
          return true;
        }
        return false;
      }
    }, RelTypes.KEY_ENTRY, Direction.OUTGOING, 
    RelTypes.SUB_TREE, Direction.OUTGOING );
  return new ValueTraverser( trav );
}

代码示例来源：origin: org.neo4j/neo4j-remote-graphdb

@SuppressWarnings( "deprecation" )
private static void verifyFriendsOf( Node thomas ) throws Exception
{
  Traverser traverser = thomas.traverse( Order.BREADTH_FIRST,
      StopEvaluator.END_OF_GRAPH,
      ReturnableEvaluator.ALL_BUT_START_NODE, MatrixRelation.KNOWS,
      Direction.OUTGOING );
  Set<String> actual = new HashSet<String>();
  for ( Node friend : traverser )
  {
    assertTrue( "Same friend added twice.",
        actual.add( (String) friend.getProperty( "name" ) ) );
  }
  assertEquals( "Thomas Anderssons friends are incorrect.",
      new HashSet<String>( Arrays.asList( "Trinity", "Morpheus",
          "Cypher", "Agent Smith" ) ), actual );
}

代码示例来源：origin: org.neo4j/neo4j-remote-graphdb

@SuppressWarnings( { "serial", "deprecation" } )
  private static void verifyHackersInNetworkOf( Node thomas )
      throws Exception
  {
    Traverser traverser = thomas.traverse( Order.BREADTH_FIRST,
        StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator()
        {
          public boolean isReturnableNode( TraversalPosition pos )
          {
            return pos.notStartNode()
                && pos.lastRelationshipTraversed().isType(
                    MatrixRelation.CODED_BY );
          }
        }, MatrixRelation.CODED_BY, Direction.OUTGOING,
        MatrixRelation.KNOWS, Direction.OUTGOING );
    Map<String, Integer> actual = new HashMap<String, Integer>();
    for ( Node hacker : traverser )
    {
      assertNull( "Same hacker found twice.", actual.put(
          (String) hacker.getProperty( "name" ),
          traverser.currentPosition().depth() ) );
    }
    assertEquals( "", new HashMap<String, Integer>()
    {
      {
        put( "The Architect", 4 );
      }
    }, actual );
  }
}

内容来源于网络，如有侵权，请联系作者删除！

Node

相关文章

    查看更多
    微信公众号

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多
    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com