def test_add_node_seed(self):
"""Test the add_node() method when no seeds exist."""
graph = Graph()
self.assertEqual(graph.seeds, set())
graph.add_node("Leonhard Euler", "Universitaet Basel", 1726,
38586, set(), set())
self.assertEqual(graph.seeds, set([38586]))
def test_add_node_seed(self):
"""Test the add_node() method when no seeds exist."""
graph = Graph()
self.assertEqual(graph.seeds, set())
graph.add_node("Leonhard Euler", "Universitaet Basel", 1726, 38586,
set(), set())
self.assertEqual(graph.seeds, set([38586]))
def test_get_node_list_empty(self):
"""Test the get_node_list() method for an empty graph."""
graph = Graph()
self.assertEqual(graph.get_node_list(), set())
def setUp(self):
self.record1 = Record("Carl Friedrich Gau\xdf",
u"Universit\xe4t Helmstedt", 1799, 18231)
self.node1 = Node(self.record1, set(), set())
self.graph1 = Graph(set([self.node1]))
class TestGraphMethods(unittest.TestCase):
"""Unit tests for the Graph class."""
def setUp(self):
self.record1 = Record("Carl Friedrich Gau\xdf",
u"Universit\xe4t Helmstedt", 1799, 18231)
self.node1 = Node(self.record1, set(), set())
self.graph1 = Graph(set([self.node1]))
def test_init_empty(self):
"""Test the constructor with an empty seeds set."""
graph = Graph()
self.assertEqual(graph.seeds, set())
def test_init(self):
"""Test the constructor."""
self.assertEqual(self.graph1.seeds, set([18231]))
self.assertEqual(list(self.graph1.keys()), [18231])
self.assertEqual(self.graph1[18231], self.node1)
def test_init_bad_seeds(self):
"""
Test the constructor when passed a bad type for the seeds parameter.
"""
self.assertRaises(TypeError, Graph, 3)
def test_has_node_true(self):
"""Test the has_node() method for a True case."""
self.assertEqual(self.graph1.has_node(18231), True)
def test_has_node_false(self):
"""Test the has_node() method for a False case."""
self.assertEqual(self.graph1.has_node(1), False)
def test_contains_node_true(self):
"""Test the __contains__() method for a True case."""
self.assertEqual(18231 in self.graph1, True)
def test_contains_node_false(self):
"""Test the __contains__() method for a False case."""
self.assertEqual(1 in self.graph1, False)
def test_get_node(self):
"""Test the get_node() method."""
node = self.graph1.get_node(18231)
self.assertTrue(node == self.node1)
def test_get_node_not_found(self):
"""
Test the get_node() method for a case where the node does not exist.
"""
self.assertRaises(KeyError, self.graph1.get_node, 1)
def test_get_node_list(self):
"""Test the get_node_list() method."""
self.assertEqual(self.graph1.get_node_list(), set([18231]))
def test_get_node_list_empty(self):
"""Test the get_node_list() method for an empty graph."""
graph = Graph()
self.assertEqual(graph.get_node_list(), set())
def test_add_node(self):
"""Test the add_node() method."""
self.graph1.add_node("Leonhard Euler", "Universitaet Basel", 1726,
38586, set(), set())
self.assertEqual(set([38586, 18231]), self.graph1.get_node_list())
self.assertEqual(self.graph1.seeds, set([18231]))
def test_add_second_node_seed(self):
"""Test the add_node() method when adding a second node and
marking it as a seed node."""
self.graph1.add_node("Leonhard Euler", "Universitaet Basel", 1726,
38586, set(), set(), True)
self.assertEqual(set([38586, 18231]), self.graph1.get_node_list())
self.assertEqual(self.graph1.seeds, set([18231, 38586]))
def test_add_node_seed(self):
"""Test the add_node() method when no seeds exist."""
graph = Graph()
self.assertEqual(graph.seeds, set())
graph.add_node("Leonhard Euler", "Universitaet Basel", 1726, 38586,
set(), set())
self.assertEqual(graph.seeds, set([38586]))
def test_add_node_already_present(self):
"""Test for expected exception when adding a duplicate node."""
self.graph1.add_node("Leonhard Euler", "Universitaet Basel", 1726,
38586, set(), set())
self.assertEqual(set([38586, 18231]), self.graph1.get_node_list())
self.assertRaises(
DuplicateNodeError,
self.graph1.add_node,
"Leonhard Euler",
"Universitaet Basel",
1726,
38586,
set(),
set(),
)
try:
self.graph1.add_node("Leonhard Euler", "Universitaet Basel", 1726,
38586, set(), set())
except DuplicateNodeError as e:
self.assertEqual(str(e),
"node with id {} already exists".format(38586))
else:
self.fail()
def test_add_node_object(self):
"""Test the add_node_object() method."""
record = Record("Leonhard Euler", "Universitaet Basel", 1726, 38586)
node = Node(record, set(), set())
self.graph1.add_node_object(node)
self.assertEqual(set([38586, 18231]), self.graph1.get_node_list())
self.assertEqual(self.graph1.seeds, set([18231]))
def test_generate_dot_file(self):
"""Test the generate_dot_file() method."""
dotfileexpt = """digraph genealogy {
graph [charset="utf-8"];
node [shape=plaintext];
edge [style=bold];
18231 [label="Carl Friedrich Gau\xdf \\nUniversit\xe4t Helmstedt (1799)"];
}
"""
dotfile = self.graph1.generate_dot_file(True, False)
self.assertEqual(dotfile, dotfileexpt)
def test_generate_dot_file2(self):
"""Test the generate_dot_file() method.
This is a larger example than test_generate_dot_file()."""
graph = Graph()
graph.add_node(
"Carl Friedrich Gau\xdf",
"Universit\xe4t Helmstedt",
1799,
18231,
set([18230]),
set(),
)
graph.add_node(
"Johann Friedrich Pfaff",
"Georg-August-Universit\xe4t Goettingen",
1786,
18230,
set([66476]),
set([18231]),
)
graph.add_node(
"Abraham Gotthelf Kaestner",
"Universit\xe4t Leipzig",
1739,
66476,
set([57670]),
set([18230]),
)
graph.add_node(
"Christian August Hausen",
"Martin-Luther-Universit\xe4t Halle-Wittenberg",
1713,
57670,
set([72669]),
set([66476]),
)
graph.add_node(
"Johann Christoph Wichmannshausen",
"Universit\xe4t Leipzig",
1685,
72669,
set([21235]),
set([57670]),
)
graph.add_node("Otto Mencke", "Universit\xe4t Leipzig", 1665, 21235,
set(), set([72669]))
dotfileexpt = """digraph genealogy {
graph [charset="utf-8"];
node [shape=plaintext];
edge [style=bold];
18231 [label="Carl Friedrich Gau\xdf \\nUniversit\xe4t Helmstedt (1799)"];
18230 [label="Johann Friedrich Pfaff \\nGeorg-August-Universit\xe4t \
Goettingen (1786)"];
66476 [label="Abraham Gotthelf Kaestner \\nUniversit\xe4t Leipzig (1739)"];
57670 [label="Christian August Hausen \\nMartin-Luther-Universit\xe4t \
Halle-Wittenberg (1713)"];
72669 [label="Johann Christoph Wichmannshausen \\nUniversit\xe4t Leipzig \
(1685)"];
21235 [label="Otto Mencke \\nUniversit\xe4t Leipzig (1665)"];
18230 -> 18231;
66476 -> 18230;
57670 -> 66476;
72669 -> 57670;
21235 -> 72669;
}
"""
dotfile = graph.generate_dot_file(True, False)
self.assertEqual(dotfile, dotfileexpt)
def test_incremental_ancestor_descendant_check(self):
"""Test the contents of the ancestors and descendants members of a
graph's nodes as they are added."""
graph = Graph()
graph.add_node(
"Carl Friedrich Gau\xdf",
"Universit\xe4t Helmstedt",
1799,
18231,
set([18230]),
set([18603, 18233, 62547]),
)
node1 = graph[18231]
self.assertEqual(node1.ancestors, set())
self.assertEqual(node1.descendants, set())
graph.add_node(
"Johann Friedrich Pfaff",
"Georg-August-Universit\xe4t Goettingen",
1786,
18230,
set([66476]),
set([18231]),
)
node2 = graph[18230]
self.assertEqual(node1.ancestors, set([18230]))
self.assertEqual(node1.descendants, set())
self.assertEqual(node2.ancestors, set())
self.assertEqual(node2.descendants, set([18231]))
graph.add_node(
"Abraham Gotthelf Kaestner",
"Universit\xe4t Leipzig",
1739,
66476,
set([57670]),
set([18230]),
)
node3 = graph[66476]
self.assertEqual(node1.ancestors, set([18230]))
self.assertEqual(node1.descendants, set())
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set())
self.assertEqual(node3.descendants, set([18230]))
graph.add_node(
"Christian August Hausen",
"Martin-Luther-Universit\xe4t Halle-Wittenberg",
1713,
57670,
set([72669]),
set([66476]),
)
node4 = graph[57670]
self.assertEqual(node1.ancestors, set([18230]))
self.assertEqual(node1.descendants, set())
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set([57670]))
self.assertEqual(node3.descendants, set([18230]))
self.assertEqual(node4.ancestors, set())
self.assertEqual(node4.descendants, set([66476]))
graph.add_node(
"Johann Christoph Wichmannshausen",
"Universit\xe4t Leipzig",
1685,
72669,
set([21235]),
set([57670]),
)
node5 = graph[72669]
self.assertEqual(node1.ancestors, set([18230]))
self.assertEqual(node1.descendants, set())
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set([57670]))
self.assertEqual(node3.descendants, set([18230]))
self.assertEqual(node4.ancestors, set([72669]))
self.assertEqual(node4.descendants, set([66476]))
self.assertEqual(node5.ancestors, set())
self.assertEqual(node5.descendants, set([57670]))
graph.add_node("Otto Mencke", "Universit\xe4t Leipzig", 1665, 21235,
set(), set([72669]))
node6 = graph[21235]
self.assertEqual(node1.ancestors, set([18230]))
self.assertEqual(node1.descendants, set())
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set([57670]))
self.assertEqual(node3.descendants, set([18230]))
self.assertEqual(node4.ancestors, set([72669]))
self.assertEqual(node4.descendants, set([66476]))
self.assertEqual(node5.ancestors, set([21235]))
self.assertEqual(node5.descendants, set([57670]))
self.assertEqual(node6.ancestors, set())
self.assertEqual(node6.descendants, set([72669]))
def test_incremental_ancestor_descendant_check2(self):
"""Test the contents of the ancestors and descendants members of a
# graph's nodes as they are added inserted in a different ofder than
# in the previous test."""
graph = Graph()
graph.add_node(
"Abraham Gotthelf Kaestner",
"Universit\xe4t Leipzig",
1739,
66476,
set([57670]),
set([18230]),
)
node1 = graph[66476]
self.assertEqual(node1.ancestors, set())
self.assertEqual(node1.descendants, set())
graph.add_node(
"Johann Friedrich Pfaff",
"Georg-August-Universit\xe4t Goettingen",
1786,
18230,
set([66476]),
set([18231]),
)
node2 = graph[18230]
self.assertEqual(node1.ancestors, set())
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
graph.add_node(
"Christian August Hausen",
"Martin-Luther-Universit\xe4t Halle-Wittenberg",
1713,
57670,
set([72669]),
set([66476]),
)
node3 = graph[57670]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set())
self.assertEqual(node3.descendants, set([66476]))
graph.add_node(
"Johann Christoph Wichmannshausen",
"Universit\xe4t Leipzig",
1685,
72669,
set([21235]),
set([57670]),
)
node4 = graph[72669]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set())
self.assertEqual(node4.descendants, set([57670]))
graph.add_node("Otto Mencke", "Universit\xe4t Leipzig", 1665, 21235,
set(), set([72669]))
node5 = graph[21235]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set([21235]))
self.assertEqual(node4.descendants, set([57670]))
self.assertEqual(node5.ancestors, set())
self.assertEqual(node5.descendants, set([72669]))
graph.add_node(
"Carl Friedrich Gau\xdf",
"Universit\xe4t Helmstedt",
1799,
18231,
set([18230]),
set([18603, 18233, 62547]),
)
node6 = graph[18231]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set([21235]))
self.assertEqual(node4.descendants, set([57670]))
self.assertEqual(node5.ancestors, set())
self.assertEqual(node5.descendants, set([72669]))
self.assertEqual(node6.ancestors, set([18230]))
self.assertEqual(node6.descendants, set())
def test_incremental_ancestor_descendant_check2(self):
"""Test the contents of the ancestors and descendants members of a
# graph's nodes as they are added inserted in a different ofder than
# in the previous test."""
graph = Graph()
graph.add_node(
"Abraham Gotthelf Kaestner",
"Universit\xe4t Leipzig",
1739,
66476,
set([57670]),
set([18230]),
)
node1 = graph[66476]
self.assertEqual(node1.ancestors, set())
self.assertEqual(node1.descendants, set())
graph.add_node(
"Johann Friedrich Pfaff",
"Georg-August-Universit\xe4t Goettingen",
1786,
18230,
set([66476]),
set([18231]),
)
node2 = graph[18230]
self.assertEqual(node1.ancestors, set())
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
graph.add_node(
"Christian August Hausen",
"Martin-Luther-Universit\xe4t Halle-Wittenberg",
1713,
57670,
set([72669]),
set([66476]),
)
node3 = graph[57670]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set())
self.assertEqual(node3.descendants, set([66476]))
graph.add_node(
"Johann Christoph Wichmannshausen",
"Universit\xe4t Leipzig",
1685,
72669,
set([21235]),
set([57670]),
)
node4 = graph[72669]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set())
self.assertEqual(node4.descendants, set([57670]))
graph.add_node("Otto Mencke", "Universit\xe4t Leipzig", 1665, 21235,
set(), set([72669]))
node5 = graph[21235]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set([21235]))
self.assertEqual(node4.descendants, set([57670]))
self.assertEqual(node5.ancestors, set())
self.assertEqual(node5.descendants, set([72669]))
graph.add_node(
"Carl Friedrich Gau\xdf",
"Universit\xe4t Helmstedt",
1799,
18231,
set([18230]),
set([18603, 18233, 62547]),
)
node6 = graph[18231]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set([21235]))
self.assertEqual(node4.descendants, set([57670]))
self.assertEqual(node5.ancestors, set())
self.assertEqual(node5.descendants, set([72669]))
self.assertEqual(node6.ancestors, set([18230]))
self.assertEqual(node6.descendants, set())
def test_generate_dot_file2(self):
"""Test the generate_dot_file() method.
This is a larger example than test_generate_dot_file()."""
graph = Graph()
graph.add_node(
"Carl Friedrich Gau\xdf",
"Universit\xe4t Helmstedt",
1799,
18231,
set([18230]),
set(),
)
graph.add_node(
"Johann Friedrich Pfaff",
"Georg-August-Universit\xe4t Goettingen",
1786,
18230,
set([66476]),
set([18231]),
)
graph.add_node(
"Abraham Gotthelf Kaestner",
"Universit\xe4t Leipzig",
1739,
66476,
set([57670]),
set([18230]),
)
graph.add_node(
"Christian August Hausen",
"Martin-Luther-Universit\xe4t Halle-Wittenberg",
1713,
57670,
set([72669]),
set([66476]),
)
graph.add_node(
"Johann Christoph Wichmannshausen",
"Universit\xe4t Leipzig",
1685,
72669,
set([21235]),
set([57670]),
)
graph.add_node("Otto Mencke", "Universit\xe4t Leipzig", 1665, 21235,
set(), set([72669]))
dotfileexpt = """digraph genealogy {
graph [charset="utf-8"];
node [shape=plaintext];
edge [style=bold];
18231 [label="Carl Friedrich Gau\xdf \\nUniversit\xe4t Helmstedt (1799)"];
18230 [label="Johann Friedrich Pfaff \\nGeorg-August-Universit\xe4t \
Goettingen (1786)"];
66476 [label="Abraham Gotthelf Kaestner \\nUniversit\xe4t Leipzig (1739)"];
57670 [label="Christian August Hausen \\nMartin-Luther-Universit\xe4t \
Halle-Wittenberg (1713)"];
72669 [label="Johann Christoph Wichmannshausen \\nUniversit\xe4t Leipzig \
(1685)"];
21235 [label="Otto Mencke \\nUniversit\xe4t Leipzig (1665)"];
18230 -> 18231;
66476 -> 18230;
57670 -> 66476;
72669 -> 57670;
21235 -> 72669;
}
"""
dotfile = graph.generate_dot_file(True, False)
self.assertEqual(dotfile, dotfileexpt)
def test_init_empty(self):
"""Test the constructor with an empty seeds set."""
graph = Graph()
self.assertEqual(graph.seeds, set())
def test_get_node_list_empty(self):
"""Test the get_node_list() method for an empty graph."""
graph = Graph()
self.assertEqual(graph.get_node_list(), [])
def setUp(self):
self.record1 = Record(u"Carl Friedrich Gau\xdf",
u"Universit\xe4t Helmstedt", 1799, 18231)
self.node1 = Node(self.record1, set(), set())
self.graph1 = Graph(set([self.node1]))
class TestGraphMethods(unittest.TestCase):
"""Unit tests for the Graph class."""
def setUp(self):
self.record1 = Record(u"Carl Friedrich Gau\xdf",
u"Universit\xe4t Helmstedt", 1799, 18231)
self.node1 = Node(self.record1, set(), set())
self.graph1 = Graph(set([self.node1]))
def test_init_empty(self):
"""Test the constructor with an empty seeds set."""
graph = Graph()
self.assertEqual(graph.seeds, set())
def test_init(self):
"""Test the constructor."""
self.assertEqual(self.graph1.seeds, set([18231]))
self.assertEqual(self.graph1.keys(), [18231])
self.assertEqual(self.graph1[18231], self.node1)
def test_init_bad_seeds(self):
"""
Test the constructor when passed a bad type for the seeds parameter.
"""
self.assertRaises(TypeError, Graph, 3)
def test_has_node_true(self):
"""Test the has_node() method for a True case."""
self.assertEqual(self.graph1.has_node(18231), True)
def test_has_node_false(self):
"""Test the has_node() method for a False case."""
self.assertEqual(self.graph1.has_node(1), False)
def test_contains_node_true(self):
"""Test the __contains__() method for a True case."""
self.assertEqual(18231 in self.graph1, True)
def test_contains_node_false(self):
"""Test the __contains__() method for a False case."""
self.assertEqual(1 in self.graph1, False)
def test_get_node(self):
"""Test the get_node() method."""
node = self.graph1.get_node(18231)
self.assert_(node == self.node1)
def test_get_node_not_found(self):
"""
Test the get_node() method for a case where the node does not exist.
"""
self.assertRaises(KeyError, self.graph1.get_node, 1)
def test_get_node_list(self):
"""Test the get_node_list() method."""
self.assertEqual(self.graph1.get_node_list(), [18231])
def test_get_node_list_empty(self):
"""Test the get_node_list() method for an empty graph."""
graph = Graph()
self.assertEqual(graph.get_node_list(), [])
def test_add_node(self):
"""Test the add_node() method."""
self.graph1.add_node("Leonhard Euler", "Universitaet Basel", 1726,
38586, set(), set())
self.assertEqual([38586, 18231], self.graph1.get_node_list())
self.assertEqual(self.graph1.seeds, set([18231]))
def test_add_second_node_seed(self):
"""Test the add_node() method when adding a second node and
marking it as a seed node."""
self.graph1.add_node("Leonhard Euler", "Universitaet Basel", 1726,
38586, set(), set(), True)
self.assertEqual([38586, 18231], self.graph1.get_node_list())
self.assertEqual(self.graph1.seeds, set([18231, 38586]))
def test_add_node_seed(self):
"""Test the add_node() method when no seeds exist."""
graph = Graph()
self.assertEqual(graph.seeds, set())
graph.add_node("Leonhard Euler", "Universitaet Basel", 1726,
38586, set(), set())
self.assertEqual(graph.seeds, set([38586]))
def test_add_node_already_present(self):
"""Test for expected exception when adding a duplicate node."""
self.graph1.add_node("Leonhard Euler", "Universitaet Basel", 1726,
38586, set(), set())
self.assertEqual([38586, 18231], self.graph1.get_node_list())
self.assertRaises(DuplicateNodeError, self.graph1.add_node,
"Leonhard Euler", "Universitaet Basel",
1726, 38586, set(), set())
try:
self.graph1.add_node("Leonhard Euler", "Universitaet Basel",
1726, 38586, set(), set())
except DuplicateNodeError as e:
self.assertEqual(str(e),
"node with id {} already exists".format(38586))
else:
self.fail()
def test_add_node_object(self):
"""Test the add_node_object() method."""
record = Record("Leonhard Euler", "Universitaet Basel", 1726, 38586)
node = Node(record, set(), set())
self.graph1.add_node_object(node)
self.assertEqual([38586, 18231], self.graph1.get_node_list())
self.assertEqual(self.graph1.seeds, set([18231]))
def test_generate_dot_file(self):
"""Test the generate_dot_file() method."""
dotfileexpt = u"""digraph genealogy {
graph [charset="utf-8"];
node [shape=plaintext];
edge [style=bold];
18231 [label="Carl Friedrich Gau\xdf \\nUniversit\xe4t Helmstedt (1799)"];
}
"""
dotfile = self.graph1.generate_dot_file(True, False)
self.assertEqual(dotfile, dotfileexpt)
def test_generate_dot_file2(self):
"""Test the generate_dot_file() method.
This is a larger example than test_generate_dot_file()."""
graph = Graph()
graph.add_node(u"Carl Friedrich Gau\xdf", u"Universit\xe4t Helmstedt",
1799, 18231, set([18230]), set())
graph.add_node(u"Johann Friedrich Pfaff",
u"Georg-August-Universit\xe4t Goettingen", 1786, 18230,
set([66476]), set([18231]))
graph.add_node(u"Abraham Gotthelf Kaestner", u"Universit\xe4t Leipzig",
1739, 66476, set([57670]), set([18230]))
graph.add_node(u"Christian August Hausen",
u"Martin-Luther-Universit\xe4t Halle-Wittenberg", 1713,
57670, set([72669]), set([66476]))
graph.add_node(u"Johann Christoph Wichmannshausen",
u"Universit\xe4t Leipzig", 1685, 72669, set([21235]),
set([57670]))
graph.add_node(u"Otto Mencke", u"Universit\xe4t Leipzig", 1665, 21235,
set(), set([72669]))
dotfileexpt = u"""digraph genealogy {
graph [charset="utf-8"];
node [shape=plaintext];
edge [style=bold];
18231 [label="Carl Friedrich Gau\xdf \\nUniversit\xe4t Helmstedt (1799)"];
18230 [label="Johann Friedrich Pfaff \\nGeorg-August-Universit\xe4t \
Goettingen (1786)"];
66476 [label="Abraham Gotthelf Kaestner \\nUniversit\xe4t Leipzig (1739)"];
57670 [label="Christian August Hausen \\nMartin-Luther-Universit\xe4t \
Halle-Wittenberg (1713)"];
72669 [label="Johann Christoph Wichmannshausen \\nUniversit\xe4t Leipzig \
(1685)"];
21235 [label="Otto Mencke \\nUniversit\xe4t Leipzig (1665)"];
18230 -> 18231;
66476 -> 18230;
57670 -> 66476;
72669 -> 57670;
21235 -> 72669;
}
"""
dotfile = graph.generate_dot_file(True, False)
self.assertEqual(dotfile, dotfileexpt)
def test_incremental_ancestor_descendant_check(self):
"""Test the contents of the ancestors and descendants members of a
graph's nodes as they are added."""
graph = Graph()
graph.add_node(u"Carl Friedrich Gau\xdf", u"Universit\xe4t Helmstedt",
1799, 18231, set([18230]), set([18603, 18233, 62547]))
node1 = graph[18231]
self.assertEqual(node1.ancestors, set())
self.assertEqual(node1.descendants, set())
graph.add_node(u"Johann Friedrich Pfaff",
u"Georg-August-Universit\xe4t Goettingen", 1786, 18230,
set([66476]), set([18231]))
node2 = graph[18230]
self.assertEqual(node1.ancestors, set([18230]))
self.assertEqual(node1.descendants, set())
self.assertEqual(node2.ancestors, set())
self.assertEqual(node2.descendants, set([18231]))
graph.add_node(u"Abraham Gotthelf Kaestner", u"Universit\xe4t Leipzig",
1739, 66476, set([57670]), set([18230]))
node3 = graph[66476]
self.assertEqual(node1.ancestors, set([18230]))
self.assertEqual(node1.descendants, set())
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set())
self.assertEqual(node3.descendants, set([18230]))
graph.add_node(u"Christian August Hausen",
u"Martin-Luther-Universit\xe4t Halle-Wittenberg", 1713,
57670, set([72669]), set([66476]))
node4 = graph[57670]
self.assertEqual(node1.ancestors, set([18230]))
self.assertEqual(node1.descendants, set())
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set([57670]))
self.assertEqual(node3.descendants, set([18230]))
self.assertEqual(node4.ancestors, set())
self.assertEqual(node4.descendants, set([66476]))
graph.add_node(u"Johann Christoph Wichmannshausen",
u"Universit\xe4t Leipzig", 1685, 72669, set([21235]),
set([57670]))
node5 = graph[72669]
self.assertEqual(node1.ancestors, set([18230]))
self.assertEqual(node1.descendants, set())
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set([57670]))
self.assertEqual(node3.descendants, set([18230]))
self.assertEqual(node4.ancestors, set([72669]))
self.assertEqual(node4.descendants, set([66476]))
self.assertEqual(node5.ancestors, set())
self.assertEqual(node5.descendants, set([57670]))
graph.add_node(u"Otto Mencke", u"Universit\xe4t Leipzig", 1665, 21235,
set(), set([72669]))
node6 = graph[21235]
self.assertEqual(node1.ancestors, set([18230]))
self.assertEqual(node1.descendants, set())
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set([57670]))
self.assertEqual(node3.descendants, set([18230]))
self.assertEqual(node4.ancestors, set([72669]))
self.assertEqual(node4.descendants, set([66476]))
self.assertEqual(node5.ancestors, set([21235]))
self.assertEqual(node5.descendants, set([57670]))
self.assertEqual(node6.ancestors, set())
self.assertEqual(node6.descendants, set([72669]))
def test_incremental_ancestor_descendant_check2(self):
"""Test the contents of the ancestors and descendants members of a
# graph's nodes as they are added inserted in a different ofder than
# in the previous test."""
graph = Graph()
graph.add_node(u"Abraham Gotthelf Kaestner", u"Universit\xe4t Leipzig",
1739, 66476, set([57670]), set([18230]))
node1 = graph[66476]
self.assertEqual(node1.ancestors, set())
self.assertEqual(node1.descendants, set())
graph.add_node(u"Johann Friedrich Pfaff",
u"Georg-August-Universit\xe4t Goettingen", 1786, 18230,
set([66476]), set([18231]))
node2 = graph[18230]
self.assertEqual(node1.ancestors, set())
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
graph.add_node(u"Christian August Hausen",
u"Martin-Luther-Universit\xe4t Halle-Wittenberg", 1713,
57670, set([72669]), set([66476]))
node3 = graph[57670]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set())
self.assertEqual(node3.descendants, set([66476]))
graph.add_node(u"Johann Christoph Wichmannshausen",
u"Universit\xe4t Leipzig", 1685, 72669, set([21235]),
set([57670]))
node4 = graph[72669]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set())
self.assertEqual(node4.descendants, set([57670]))
graph.add_node(u"Otto Mencke", u"Universit\xe4t Leipzig", 1665, 21235,
set(), set([72669]))
node5 = graph[21235]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set([21235]))
self.assertEqual(node4.descendants, set([57670]))
self.assertEqual(node5.ancestors, set())
self.assertEqual(node5.descendants, set([72669]))
graph.add_node(u"Carl Friedrich Gau\xdf", u"Universit\xe4t Helmstedt",
1799, 18231, set([18230]), set([18603, 18233, 62547]))
node6 = graph[18231]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set([21235]))
self.assertEqual(node4.descendants, set([57670]))
self.assertEqual(node5.ancestors, set())
self.assertEqual(node5.descendants, set([72669]))
self.assertEqual(node6.ancestors, set([18230]))
self.assertEqual(node6.descendants, set())
def test_incremental_ancestor_descendant_check2(self):
"""Test the contents of the ancestors and descendants members of a
# graph's nodes as they are added inserted in a different ofder than
# in the previous test."""
graph = Graph()
graph.add_node(u"Abraham Gotthelf Kaestner", u"Universit\xe4t Leipzig",
1739, 66476, set([57670]), set([18230]))
node1 = graph[66476]
self.assertEqual(node1.ancestors, set())
self.assertEqual(node1.descendants, set())
graph.add_node(u"Johann Friedrich Pfaff",
u"Georg-August-Universit\xe4t Goettingen", 1786, 18230,
set([66476]), set([18231]))
node2 = graph[18230]
self.assertEqual(node1.ancestors, set())
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
graph.add_node(u"Christian August Hausen",
u"Martin-Luther-Universit\xe4t Halle-Wittenberg", 1713,
57670, set([72669]), set([66476]))
node3 = graph[57670]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set())
self.assertEqual(node3.descendants, set([66476]))
graph.add_node(u"Johann Christoph Wichmannshausen",
u"Universit\xe4t Leipzig", 1685, 72669, set([21235]),
set([57670]))
node4 = graph[72669]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set())
self.assertEqual(node4.descendants, set([57670]))
graph.add_node(u"Otto Mencke", u"Universit\xe4t Leipzig", 1665, 21235,
set(), set([72669]))
node5 = graph[21235]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set())
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set([21235]))
self.assertEqual(node4.descendants, set([57670]))
self.assertEqual(node5.ancestors, set())
self.assertEqual(node5.descendants, set([72669]))
graph.add_node(u"Carl Friedrich Gau\xdf", u"Universit\xe4t Helmstedt",
1799, 18231, set([18230]), set([18603, 18233, 62547]))
node6 = graph[18231]
self.assertEqual(node1.ancestors, set([57670]))
self.assertEqual(node1.descendants, set([18230]))
self.assertEqual(node2.ancestors, set([66476]))
self.assertEqual(node2.descendants, set([18231]))
self.assertEqual(node3.ancestors, set([72669]))
self.assertEqual(node3.descendants, set([66476]))
self.assertEqual(node4.ancestors, set([21235]))
self.assertEqual(node4.descendants, set([57670]))
self.assertEqual(node5.ancestors, set())
self.assertEqual(node5.descendants, set([72669]))
self.assertEqual(node6.ancestors, set([18230]))
self.assertEqual(node6.descendants, set())
def test_generate_dot_file2(self):
"""Test the generate_dot_file() method.
This is a larger example than test_generate_dot_file()."""
graph = Graph()
graph.add_node(u"Carl Friedrich Gau\xdf", u"Universit\xe4t Helmstedt",
1799, 18231, set([18230]), set())
graph.add_node(u"Johann Friedrich Pfaff",
u"Georg-August-Universit\xe4t Goettingen", 1786, 18230,
set([66476]), set([18231]))
graph.add_node(u"Abraham Gotthelf Kaestner", u"Universit\xe4t Leipzig",
1739, 66476, set([57670]), set([18230]))
graph.add_node(u"Christian August Hausen",
u"Martin-Luther-Universit\xe4t Halle-Wittenberg", 1713,
57670, set([72669]), set([66476]))
graph.add_node(u"Johann Christoph Wichmannshausen",
u"Universit\xe4t Leipzig", 1685, 72669, set([21235]),
set([57670]))
graph.add_node(u"Otto Mencke", u"Universit\xe4t Leipzig", 1665, 21235,
set(), set([72669]))
dotfileexpt = u"""digraph genealogy {
graph [charset="utf-8"];
node [shape=plaintext];
edge [style=bold];
18231 [label="Carl Friedrich Gau\xdf \\nUniversit\xe4t Helmstedt (1799)"];
18230 [label="Johann Friedrich Pfaff \\nGeorg-August-Universit\xe4t \
Goettingen (1786)"];
66476 [label="Abraham Gotthelf Kaestner \\nUniversit\xe4t Leipzig (1739)"];
57670 [label="Christian August Hausen \\nMartin-Luther-Universit\xe4t \
Halle-Wittenberg (1713)"];
72669 [label="Johann Christoph Wichmannshausen \\nUniversit\xe4t Leipzig \
(1685)"];
21235 [label="Otto Mencke \\nUniversit\xe4t Leipzig (1665)"];
18230 -> 18231;
66476 -> 18230;
57670 -> 66476;
72669 -> 57670;
21235 -> 72669;
}
"""
dotfile = graph.generate_dot_file(True, False)
self.assertEqual(dotfile, dotfileexpt)
