C# (CSharp) Voron.Graph.Algorithms.Traversal TraversalNodeInfo Examples

Example #1

File: EdmondsKarpMaximumFlow.cs Project: josephi/Voron.Graph

            public void ExamineTraversalInfo(TraversalNodeInfo traversalNodeInfo)
            {
                _currentTraversalNodeInfo = traversalNodeInfo;

                if (traversalNodeInfo.ParentNode != null)
                {
                    _previousNodeInPath[traversalNodeInfo.CurrentNode.Key] = traversalNodeInfo.ParentNode.Key;

                    if (_targetNode != null && _currentTraversalNodeInfo.CurrentNode.Key == _targetNode.Key)
                    {
                        UpdateFlowCosts();
                        _hasDiscoveredDestination = true;
                    }
                }
            }

Example #2

File: MultiDestinationShortestPathVisitor.cs Project: josephi/Voron.Graph

 public void ExamineTraversalInfo(TraversalNodeInfo traversalNodeInfo)
 {
     _currentTraversalNodeInfo = traversalNodeInfo;
 }

Example #3

File: SearchVisitor.cs Project: josephi/Voron.Graph

 public void ExamineTraversalInfo(TraversalNodeInfo traversalNodeInfo)
 {
     if (_searchPredicate(traversalNodeInfo.CurrentNode.Data))
         _results.Add(traversalNodeInfo.CurrentNode);
 }