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

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

本文整理了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

  1. Iterable<Node> getAllTimeNodes()
  2. {
  3.   return underlyingNode.traverse( Order.DEPTH_FIRST,
  4.       StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator()
  5.       {
  6.         public boolean isReturnableNode( TraversalPosition position )
  7.         {
  8.           return position.depth() > 0;
  9.         }
  10.       }, RelTypes.TIMELINE_NEXT_ENTRY, Direction.OUTGOING );
  11. }

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

  1. Iterable<Node> getAllTimeNodes()
  2. {
  3.   return underlyingNode.traverse( Order.DEPTH_FIRST,
  4.       StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator()
  5.       {
  6.         public boolean isReturnableNode( TraversalPosition position )
  7.         {
  8.           return position.depth() > 0;
  9.         }
  10.       }, RelTypes.TIMELINE_NEXT_ENTRY, Direction.OUTGOING );
  11. }

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

  1. public Iterable<Node> getAllNodes()
  2. {
  3.   return underlyingNode.traverse(
  4.       Order.BREADTH_FIRST,
  5.       StopEvaluator.END_OF_GRAPH,
  6.       new ReturnableEvaluator()
  7.       {
  8.         public boolean isReturnableNode( TraversalPosition position )
  9.         {
  10.           Relationship last = position.lastRelationshipTraversed();
  11.           if ( last != null
  12.              && last.isType(
  13.                  RelTypes.TIMELINE_INSTANCE ) )
  14.           {
  15.             return true;
  16.           }
  17.           return false;
  18.         }
  19.       }, RelTypes.TIMELINE_INSTANCE, Direction.OUTGOING,
  20.       RelTypes.TIMELINE_NEXT_ENTRY, Direction.OUTGOING );
  21. }

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

  1. public Iterable<Node> getAllNodes()
  2. {
  3.   return underlyingNode.traverse(
  4.       Order.BREADTH_FIRST,
  5.       StopEvaluator.END_OF_GRAPH,
  6.       new ReturnableEvaluator()
  7.       {
  8.         public boolean isReturnableNode( TraversalPosition position )
  9.         {
  10.           Relationship last = position.lastRelationshipTraversed();
  11.           if ( last != null
  12.              && last.getType().equals(
  13.                  RelTypes.TIMELINE_INSTANCE ) )
  14.           {
  15.             return true;
  16.           }
  17.           return false;
  18.         }
  19.       }, RelTypes.TIMELINE_INSTANCE, Direction.OUTGOING,
  20.       RelTypes.TIMELINE_NEXT_ENTRY, Direction.OUTGOING );
  21. }

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

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

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

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

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

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

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

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

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

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

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

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

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

  1. public Iterator<Node> iterate()
  2.   {
  3.     StopEvaluator stopEvaluator = new StopEvaluator()
  4.     {
  5.       public boolean isStopNode( TraversalPosition pos )
  6.       {
  7.         return pos.lastRelationshipTraversed() != null &&
  8.           pos.currentNode().equals( rootNode );
  9.       }
  10.     };
  11.     
  12.     Traverser traverser = rootNode.traverse( Order.BREADTH_FIRST,
  13.       stopEvaluator, ReturnableEvaluator.ALL_BUT_START_NODE, relType,
  14.       Direction.OUTGOING );
  15.     return traverser.iterator();
  16.   }
  17. }

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

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

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

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

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

  1. /**
  2.  * Returns all the entries in this b-tree. The iterable returned back is
  3.  * a wrapped {@link Traverser}.
  4.  * 
  5.  * @return an Iterable of all the entries in this b-tree
  6.  */
  7. public Iterable<KeyEntry> entries()
  8. {
  9.   EntryReturnableEvaluator entryEvaluator = 
  10.     new EntryReturnableEvaluator();
  11.   
  12.   Traverser trav = treeRoot.getUnderlyingNode().traverse( 
  13.     Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, 
  14.     entryEvaluator, RelTypes.KEY_ENTRY, Direction.OUTGOING, 
  15.     RelTypes.SUB_TREE, Direction.OUTGOING );
  16.   return new EntryTraverser( trav, this, entryEvaluator );
  17. }

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

  1. /**
  2.  * Returns all the entries in this b-tree. The iterable returned back is
  3.  * a wrapped {@link Traverser}.
  4.  * 
  5.  * @return an Iterable of all the entries in this b-tree
  6.  */
  7. public Iterable<KeyEntry> entries()
  8. {
  9.   EntryReturnableEvaluator entryEvaluator = 
  10.     new EntryReturnableEvaluator();
  11.   
  12.   Traverser trav = treeRoot.getUnderlyingNode().traverse( 
  13.     Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, 
  14.     entryEvaluator, RelTypes.KEY_ENTRY, Direction.OUTGOING, 
  15.     RelTypes.SUB_TREE, Direction.OUTGOING );
  16.   return new EntryTraverser( trav, this, entryEvaluator );
  17. }

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

  1. /**
  2.  * Returns the values of all entries in this b-tree. The iterable which is
  3.  * returned back is wrapped {@link Traverser}.
  4.  * 
  5.  * @return the values of all entries values in this b-tree.
  6.  */
  7. public Iterable<Object> values()
  8. {
  9.   Traverser trav = getTreeRoot().getUnderlyingNode().traverse( 
  10.     Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, 
  11.     new ReturnableEvaluator()
  12.     {
  13.       public boolean isReturnableNode( TraversalPosition pos )
  14.       {
  15.         Relationship last = pos.lastRelationshipTraversed();
  16.         if ( last != null && last.getType().equals( 
  17.           RelTypes.KEY_ENTRY ) )
  18.         {
  19.           return true;
  20.         }
  21.         return false;
  22.       }
  23.     }, RelTypes.KEY_ENTRY, Direction.OUTGOING, 
  24.     RelTypes.SUB_TREE, Direction.OUTGOING );
  25.   return new ValueTraverser( trav );
  26. }

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

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

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

  1. /**
  2.  * Returns the values of all entries in this b-tree. The iterable which is
  3.  * returned back is wrapped {@link Traverser}.
  4.  * 
  5.  * @return the values of all entries values in this b-tree.
  6.  */
  7. public Iterable<Object> values()
  8. {
  9.   Traverser trav = getTreeRoot().getUnderlyingNode().traverse( 
  10.     Order.DEPTH_FIRST, StopEvaluator.END_OF_GRAPH, 
  11.     new ReturnableEvaluator()
  12.     {
  13.       public boolean isReturnableNode( TraversalPosition pos )
  14.       {
  15.         Relationship last = pos.lastRelationshipTraversed();
  16.         if ( last != null && last.getType().equals( 
  17.           RelTypes.KEY_ENTRY ) )
  18.         {
  19.           return true;
  20.         }
  21.         return false;
  22.       }
  23.     }, RelTypes.KEY_ENTRY, Direction.OUTGOING, 
  24.     RelTypes.SUB_TREE, Direction.OUTGOING );
  25.   return new ValueTraverser( trav );
  26. }

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

  1. @SuppressWarnings( "deprecation" )
  2. private static void verifyFriendsOf( Node thomas ) throws Exception
  3. {
  4.   Traverser traverser = thomas.traverse( Order.BREADTH_FIRST,
  5.       StopEvaluator.END_OF_GRAPH,
  6.       ReturnableEvaluator.ALL_BUT_START_NODE, MatrixRelation.KNOWS,
  7.       Direction.OUTGOING );
  8.   Set<String> actual = new HashSet<String>();
  9.   for ( Node friend : traverser )
  10.   {
  11.     assertTrue( "Same friend added twice.",
  12.         actual.add( (String) friend.getProperty( "name" ) ) );
  13.   }
  14.   assertEquals( "Thomas Anderssons friends are incorrect.",
  15.       new HashSet<String>( Arrays.asList( "Trinity", "Morpheus",
  16.           "Cypher", "Agent Smith" ) ), actual );
  17. }

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

  1. @SuppressWarnings( { "serial", "deprecation" } )
  2.   private static void verifyHackersInNetworkOf( Node thomas )
  3.       throws Exception
  4.   {
  5.     Traverser traverser = thomas.traverse( Order.BREADTH_FIRST,
  6.         StopEvaluator.END_OF_GRAPH, new ReturnableEvaluator()
  7.         {
  8.           public boolean isReturnableNode( TraversalPosition pos )
  9.           {
  10.             return pos.notStartNode()
  11.                 && pos.lastRelationshipTraversed().isType(
  12.                     MatrixRelation.CODED_BY );
  13.           }
  14.         }, MatrixRelation.CODED_BY, Direction.OUTGOING,
  15.         MatrixRelation.KNOWS, Direction.OUTGOING );
  16.     Map<String, Integer> actual = new HashMap<String, Integer>();
  17.     for ( Node hacker : traverser )
  18.     {
  19.       assertNull( "Same hacker found twice.", actual.put(
  20.           (String) hacker.getProperty( "name" ),
  21.           traverser.currentPosition().depth() ) );
  22.     }
  23.     assertEquals( "", new HashMap<String, Integer>()
  24.     {
  25.       {
  26.         put( "The Architect", 4 );
  27.       }
  28.     }, actual );
  29.   }
  30. }

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

Node

相关文章

    查看更多

    热门标签

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

    最新文章

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