Core/Castle.Core.Tests/GraphTestCase.cs

   1 // Copyright 2004-2008 Castle Project - http://www.castleproject.org/
   2 //
   3 // Licensed under the Apache License, Version 2.0 (the "License");
   4 // you may not use this file except in compliance with the License.
   5 // You may obtain a copy of the License at
   6 //
   7 //     http://www.apache.org/licenses/LICENSE-2.0
   8 //
   9 // Unless required by applicable law or agreed to in writing, software
  10 // distributed under the License is distributed on an "AS IS" BASIS,
  11 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  12 // See the License for the specific language governing permissions and
  13 // limitations under the License.
  14
  15 namespace Castle.Core.Tests
  16 {
  17         using System;
  18
  19         using NUnit.Framework;
  20
  21         using Castle.Core.Internal;
  22
  23         [TestFixture]
  24         public class GraphTestCase
  25         {
  26                 [Test]
  27                 public void SimpleUsage()
  28                 {
  29                         GraphNode parent = new GraphNode();
  30                         GraphNode child = new GraphNode();
  31
  32                         parent.AddDependent(child);
  33
  34                         Assert.AreSame( parent, child.Dependers[0] );
  35                         Assert.AreSame( child, parent.Dependents[0] );
  36                 }
  37
  38                 [Test]
  39                 public void Removal()
  40                 {
  41                         GraphNode parent = new GraphNode();
  42                         GraphNode child = new GraphNode();
  43
  44                         parent.AddDependent(child);
  45
  46                         child.RemoveDepender(parent);
  47
  48                         Assert.IsTrue( parent.Dependents.Length == 0 );
  49                         Assert.IsTrue( parent.Dependers.Length == 0 );
  50                         Assert.IsTrue( child.Dependers.Length == 0 );
  51                         Assert.IsTrue( child.Dependents.Length == 0 );
  52                 }
  53
  54                 [Test]
  55                 public void TopologicalSortOneElement()
  56                 {
  57                         GraphNode alone = new TestGraphNode("alone");
  58
  59                         IVertex[] nodes = TopologicalSortAlgo.Sort( new GraphNode[] { alone } );
  60
  61                         Assert.AreSame( alone, nodes[0] );
  62                 }
  63
  64                 [Test]
  65                 public void TopologicalSortSimple()
  66                 {
  67                         GraphNode alone = new TestGraphNode("alone");
  68                         GraphNode first = new TestGraphNode("first");
  69                         GraphNode second = new TestGraphNode("second");
  70                         GraphNode third = new TestGraphNode("third");
  71
  72                         first.AddDependent(second);
  73                         second.AddDependent(third);
  74
  75                         IVertex[] nodes =
  76                                 TopologicalSortAlgo.Sort( new GraphNode[] { alone, second, first, third } );
  77
  78                         Assert.AreSame( first, nodes[0] );
  79                         Assert.AreSame( second, nodes[1] );
  80                         Assert.AreSame( third, nodes[2] );
  81                         Assert.AreSame( alone, nodes[3] );
  82                 }
  83
  84                 [Test]
  85                 public void ComplexDag()
  86                 {
  87                         GraphNode shirt = new TestGraphNode("shirt");
  88                         GraphNode tie = new TestGraphNode("tie");
  89                         GraphNode jacket = new TestGraphNode("jacket");
  90                         GraphNode belt = new TestGraphNode("belt");
  91                         GraphNode watch = new TestGraphNode("watch");
  92                         GraphNode undershorts = new TestGraphNode("undershorts");
  93                         GraphNode pants = new TestGraphNode("pants");
  94                         GraphNode shoes = new TestGraphNode("shoes");
  95                         GraphNode socks = new TestGraphNode("socks");
  96
  97                         shirt.AddDependent(belt);
  98                         shirt.AddDependent(tie);
  99
 100                         tie.AddDependent(jacket);
 101
 102                         pants.AddDependent(belt);
 103                         pants.AddDependent(shoes);
 104
 105                         undershorts.AddDependent(pants);
 106                         undershorts.AddDependent(shoes);
 107
 108                         socks.AddDependent(shoes);
 109                         belt.AddDependent(jacket);
 110
 111                         IVertex[] nodes =
 112                                 TopologicalSortAlgo.Sort(
 113                                         new GraphNode[]
 114                                         { shirt, tie, jacket, belt, watch, undershorts, pants, shoes, socks} );
 115
 116                         Assert.AreSame( socks, nodes[0] );
 117                         Assert.AreSame( undershorts, nodes[1] );
 118                         Assert.AreSame( pants, nodes[2] );
 119                         Assert.AreSame( shoes, nodes[3] );
 120                         Assert.AreSame( watch, nodes[4] );
 121                         Assert.AreSame( shirt, nodes[5] );
 122                         Assert.AreSame( tie, nodes[6] );
 123                         Assert.AreSame( belt, nodes[7] );
 124                         Assert.AreSame( jacket, nodes[8] );
 125                 }
 126         }
 127
 128         public class TestGraphNode : GraphNode
 129         {
 130                 private String _name;
 131
 132                 public TestGraphNode(String name)
 133                 {
 134                         _name = name;
 135                 }
 136
 137                 public String Name
 138                 {
 139                         get { return _name; }
 140                 }
 141         }
 142 }