コード例 #1
0
        public void IsEqual_NUllVertex_ReturnTrue()
        {
            var vertex       = new NullVertex();
            var secondVertex = new NullVertex();

            Assert.IsTrue(vertex.IsEqual(secondVertex));
        }
コード例 #2
0
        public void CanBeNeighbours_VerticesBelongToGraph_ReturnsFalse()
        {
            var graph = new NullGraph();

            NullVertex candidate = (NullVertex)graph.Vertices.Last();
            NullVertex vertex    = (NullVertex)graph.Vertices.First();

            Assert.IsFalse(graph.CanBeNeighbours(candidate, vertex));
        }
コード例 #3
0
        public void AreNeighbours_VerticesDoesntBelongToGraph_ReturnFalse()
        {
            var graph = new NullGraph();

            NullVertex candidate = new NullVertex();
            NullVertex vertex    = (NullVertex)graph.Vertices.First();

            Assert.IsFalse(graph.AreNeighbours(candidate, vertex));
        }
コード例 #4
0
        public void AreNeighbours_DoesnotThrow()
        {
            NullGraph graph = new NullGraph();

            NullVertex candidate = new NullVertex();
            NullVertex vertex    = (NullVertex)graph.Vertices.First();

            Assert.DoesNotThrow(() => graph.AreNeighbours(candidate, vertex));
        }
コード例 #5
0
        public void SetNeighbours_NullVertex_NullGraph_ReturnsRightNumberOfNeighbours()
        {
            const int  expectedNumberOfNeighbours = 1;
            var        graph  = new NullGraph();
            NullVertex vertex = (NullVertex)graph.Vertices.First();

            vertex.SetNeighbours(graph);

            Assert.AreEqual(expectedNumberOfNeighbours, vertex.Neighbours.Count);
        }
コード例 #6
0
        public void SetNeighbours_NullVertex_ReturnsRightNumberOfNeighbours()
        {
            const int expectedNumberOfNeighbours = 1;
            var       graph = graphAssembler.AssembleGraph();

            graph[new TestCoordinate(0, 0)] = new NullVertex();

            NullVertex vertex = (NullVertex)graph.Vertices.First();

            vertex.SetNeighbours(graph);

            Assert.AreEqual(expectedNumberOfNeighbours, vertex.Neighbours.Count);
        }
コード例 #7
0
 public TestEndPoints()
 {
     Start = new NullVertex();
     End   = new NullVertex();
 }
コード例 #8
0
 public TestEndPoints()
 {
     Source = new NullVertex();
     Target = new NullVertex();
 }
コード例 #9
0
 public NullGraphPath()
 {
     Path = new NullVertex[] { new NullVertex() };
 }
コード例 #10
0
 protected virtual void UnsetSource(IVertex vertex)
 {
     (vertex as IMarkable)?.MarkAsRegular();
     Source = new NullVertex();
 }
コード例 #11
0
 public void Reset()
 {
     Source = new NullVertex();
     Target = new NullVertex();
 }
コード例 #12
0
ファイル: BaseEndPoints.cs プロジェクト: lanicon/PathFinding
 protected virtual void UnsetStartVertex(IVertex vertex)
 {
     (vertex as IMarkable)?.MarkAsRegular();
     Start = new NullVertex();
 }
コード例 #13
0
ファイル: BaseEndPoints.cs プロジェクト: lanicon/PathFinding
 public void Reset()
 {
     Start = new NullVertex();
     End   = new NullVertex();
 }
コード例 #14
0
        public void Initialize_DoesntThrow()
        {
            var vertex = new NullVertex();

            Assert.DoesNotThrow(() => vertex.Initialize());
        }
コード例 #15
0
        public void SetToDefault_DoesntThrow()
        {
            var vertex = new NullVertex();

            Assert.DoesNotThrow(() => vertex.SetToDefault());
        }
コード例 #16
0
        public void IsIsolated_ReturnTrue()
        {
            var vertex = new NullVertex();

            Assert.IsTrue(vertex.IsIsolated());
        }