當前位置: 首頁>>代碼示例>>C#>>正文


C# BinarySearchTree.DepthFirstTraversal方法代碼示例

本文整理匯總了C#中BinarySearchTree.DepthFirstTraversal方法的典型用法代碼示例。如果您正苦於以下問題:C# BinarySearchTree.DepthFirstTraversal方法的具體用法?C# BinarySearchTree.DepthFirstTraversal怎麽用?C# BinarySearchTree.DepthFirstTraversal使用的例子?那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在BinarySearchTree的用法示例。


在下文中一共展示了BinarySearchTree.DepthFirstTraversal方法的2個代碼示例,這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚,您的評價將有助於係統推薦出更棒的C#代碼示例。

示例1: Simple

        public void Simple()
        {
            var tree = new BinarySearchTree<string, int>
                           {
                               new KeyValuePair<string, int>("horse", 4),
                               new KeyValuePair<string, int>("cat", 1),
                               new KeyValuePair<string, int>("dog", 2),
                               new KeyValuePair<string, int>("canary", 3)
                           };

            var visitor = new TrackingVisitor<KeyValuePair<string, int>>();

            var inOrderVisitor =
                new InOrderVisitor<KeyValuePair<string, int>>(visitor);

            tree.DepthFirstTraversal(inOrderVisitor);

            Assert.AreEqual(visitor.TrackingList[0].Key, "canary");
            Assert.AreEqual(visitor.TrackingList[1].Key, "cat");
            Assert.AreEqual(visitor.TrackingList[2].Key, "dog");
            Assert.AreEqual(visitor.TrackingList[3].Key, "horse");
        }
開發者ID:havok,項目名稱:ngenerics,代碼行數:22,代碼來源:DepthFirstTraversal.cs

示例2: DepthFirstTraversalExample

        public void DepthFirstTraversalExample()
        {
            // Create a simple tree
            BinarySearchTreeBase<string, int> tree = new BinarySearchTree<string, int>
                                                         {
                                                             new KeyValuePair<string, int>("horse", 4),
                                                             new KeyValuePair<string, int>("cat", 1),
                                                             new KeyValuePair<string, int>("dog", 2),
                                                             new KeyValuePair<string, int>("canary", 3)
                                                         };

            // Create a tracking visitor which will track the items
            // the tree calls visit on.
            var visitor = new TrackingVisitor<KeyValuePair<string, int>>();

            // We'll wrap the tracking visitor in an ordered visitor and visit
            // the items in in-order order.  Effectively the visitor would visit
            // the items in sorted order.
            var inOrderVisitor =
                new InOrderVisitor<KeyValuePair<string, int>>(visitor);

            // Perform a depth-first traversal of the tree.
            tree.DepthFirstTraversal(inOrderVisitor);

            // The tracking list has the items in sorted order.
            Assert.AreEqual("canary", visitor.TrackingList[0].Key);
            Assert.AreEqual("cat", visitor.TrackingList[1].Key);
            Assert.AreEqual("dog", visitor.TrackingList[2].Key);
            Assert.AreEqual("horse", visitor.TrackingList[3].Key);
        }
開發者ID:havok,項目名稱:ngenerics,代碼行數:30,代碼來源:BinarySearchTreeBaseExamples.cs


注:本文中的BinarySearchTree.DepthFirstTraversal方法示例由純淨天空整理自Github/MSDocs等開源代碼及文檔管理平台,相關代碼片段篩選自各路編程大神貢獻的開源項目,源碼版權歸原作者所有,傳播和使用請參考對應項目的License;未經允許,請勿轉載。