Beispiel #1
0
        public void MSTest_RandomConnection_to_empty_graph()
        {
            Node node = new Node();

            Node[]  emptygraph = new Node[0];
            Dungeon d          = new Dungeon();

            d.randomConnection(node, emptygraph);
            Assert.IsTrue(node.neighbors.Count == 0);
        }
Beispiel #2
0
        public void MSTest_RandomConnection_Connect_to_same_node()
        {
            Node thisnode = new Node();

            Node[] graph = new Node[1];
            graph[0] = thisnode;
            Dungeon d = new Dungeon();

            d.randomConnection(thisnode, graph);
            Assert.IsFalse(thisnode.neighbors.Contains(thisnode));
        }
Beispiel #3
0
        public void MSTest_RandomConnection_connect_single_node_graph()
        {
            Node thisnode = new Node();

            Node[] graph = new Node[1];
            graph[0] = thisnode;
            Node    testnode = new Node("test");
            Dungeon d        = new Dungeon();

            d.randomConnection(testnode, graph);
            Assert.IsTrue(testnode.neighbors.Contains(thisnode));
            Assert.IsTrue(thisnode.neighbors.Contains(testnode));
        }
Beispiel #4
0
        public void MSTest_RandomConnection_thisnode_max_neighbors()
        {
            Node maxConnectionNode = new Node("maxConnectionNode");

            Node[] graph     = new Node[5];
            Node   graphnode = new Node();

            graph[4] = graphnode;
            for (int i = 0; i < 4; i++)
            {
                Node neighbor = new Node("neighbor " + i);
                maxConnectionNode.connect(neighbor);
            }
            Dungeon d = new Dungeon();

            d.randomConnection(maxConnectionNode, graph);
            Assert.IsTrue(maxConnectionNode.neighbors.Count == 4);
        }
Beispiel #5
0
        public void MSTest_RandomConnection_connect_multiple_node_graph()
        {
            Node node1 = new Node();
            Node node2 = new Node();
            Node node3 = new Node();

            node2.connect(node1);
            node2.connect(node3);
            Node[] graph = new Node[3];
            graph[0] = node1;
            graph[1] = node2;
            graph[2] = node3;
            Node    testnode = new Node("test");
            Dungeon d        = new Dungeon();

            d.randomConnection(testnode, graph);
            Assert.IsTrue(testnode.neighbors.Count == 1);
            Node result = testnode.neighbors[0];

            Assert.IsTrue(result.neighbors.Contains(testnode));
        }
Beispiel #6
0
        public void MSTest_RandomConnection_randomnode_max_neighbors()
        {
            Node[] graph = new Node[5];
            for (int i = 0; i < 5; i++)
            {
                graph[i] = new Node("neighbor " + i);
            }

            for (int i = 0; i < 5; i++)
            {
                for (int j = 4; j > i; j--)
                {
                    graph[i].connect(graph[j]);
                }
            }
            Node    testnode = new Node("test");
            Dungeon d        = new Dungeon();

            d.randomConnection(testnode, graph);
            Assert.IsTrue(testnode.neighbors.Count == 0);
        }