Example #1
0
def make_trivial_graph():
    """
    Construct a trivial graph:
       a ─> b
    """
    g = Graph()
    a = g.add_node(NamedNode('a'))
    b = g.add_node(NamedNode('b'))
    ab = g.add_edge(a, b)
    return g, a, b, ab
Example #2
0
def make_trivial_graph():
    """
    Construct a trivial graph:
       a ─> b
    """
    g = Graph()
    a = g.add_node(NamedNode('a'))
    b = g.add_node(NamedNode('b'))
    ab = g.add_edge(a, b)
    return g, a, b, ab
Example #3
0
 def test_cycles(self):
     LENGTH = 5
     g = Graph()
     a = add_cycle(g, LENGTH)
     b = add_cycle(g, LENGTH)
     c = add_cycle(g, LENGTH)
     ab = g.add_edge(a, b)
     bc = g.add_edge(b, c)
     path = g.get_shortest_path(a, c)
     self.assertEqual(len(path), 2)
     p0, p1 = path
     self.assertEqual(p0, ab)
     self.assertEqual(p1, bc)
Example #4
0
 def test_cycles(self):
     LENGTH = 5
     g = Graph()
     a = add_cycle(g, LENGTH)
     b = add_cycle(g, LENGTH)
     c = add_cycle(g, LENGTH)
     ab = g.add_edge(a, b)
     bc = g.add_edge(b, c)
     path = g.get_shortest_path(a, c)
     self.assertEqual(len(path), 2)
     p0, p1 = path
     self.assertEqual(p0, ab)
     self.assertEqual(p1, bc)