Exemplo n.º 1
0
        public void DungeonIsValidTest_2()
        {
            Dungeon a = new Dungeon(1, 1);

            a.dungeon_size = a.graph.Count;
            a.graph.Clear();

            Node u = new Node();

            a.graph.Add(u);
            Assert.AreEqual(false, a.dungeon_is_ok());

            Node v = new Node();
            Node w = new Node();
            Node x = new Node();

            u.id = ("" + 0);
            v.id = ("" + 1);
            w.id = ("" + 2);
            x.id = ("" + 3);

            a.graph.Add(v);
            a.graph.Add(w);
            a.graph.Add(x);

            u.connect(v);
            v.connect(w);
            w.connect(x);
            a.startNode    = u;
            a.exitNode     = x;
            a.dungeon_size = a.graph.Count;
            Assert.AreEqual(false, a.dungeon_is_ok());
        }
Exemplo n.º 2
0
        public void DungeonIsValidTest_1()
        {
            Dungeon a = new Dungeon(10, 1);

            a.graph.Clear();

            Node u = new Node();
            Node v = new Node();
            Node w = new Node();
            Node x = new Node();
            Node y = new Node();
            Node z = new Node();

            u.id = ("" + 0);
            v.id = ("" + 1);
            w.id = ("" + 2);
            x.id = ("" + 3);
            y.id = ("" + 4);
            z.id = ("" + 5);

            // 0 --> 1 --> 2
            u.connect(v);
            v.connect(w);

            a.graph.Add(u);
            a.graph.Add(v);
            a.graph.Add(w);
            a.graph.Add(x);
            a.graph.Add(y);
            a.graph.Add(z);

            a.dungeon_size = a.graph.Count;
            bool result = a.dungeon_is_ok();

            Assert.AreEqual(true, result);

            a.graph.Add(y);
            u.connect(w);
            u.connect(x);
            u.connect(y);
            u.connect(z);

            a.dungeon_size = a.graph.Count;
            result         = a.dungeon_is_ok();
            Assert.AreEqual(false, result);

            //clean
            a.graph.Clear();
            u.neighbors.Clear();
            v.neighbors.Clear();
            w.neighbors.Clear();
            x.neighbors.Clear();
            y.neighbors.Clear();
            z.neighbors.Clear();

            u.connect(v);
            u.connect(w);
            u.connect(x);
            u.connect(y);

            v.connect(u);
            v.connect(w);
            v.connect(x);
            v.connect(y);

            w.connect(u);
            w.connect(v);
            w.connect(x);
            w.connect(y);

            x.connect(u);
            x.connect(w);
            x.connect(v);
            x.connect(y);

            y.connect(u);
            y.connect(w);
            y.connect(x);
            y.connect(v);

            a.graph.Add(u);
            a.graph.Add(v);
            a.graph.Add(w);
            a.graph.Add(x);
            a.graph.Add(y);

            a.dungeon_size = a.graph.Count;
            result         = a.dungeon_is_ok();
            Assert.AreEqual(false, result);
        }