Python Graph.add_node Examples

Example #1

File: script.py Project: yinglang/gcc-python-plugin

 def test_no_path(self):
     g = Graph()
     a = g.add_node(Node())
     b = g.add_node(Node())
     # no edges between them
     path = g.get_shortest_path(a, b)
     self.assertEqual(path, [])  # FIXME: shouldn't this be None?

Example #2

File: script.py Project: B-Rich/gcc-python-plugin

 def test_no_path(self):
     g = Graph()
     a = g.add_node(Node())
     b = g.add_node(Node())
     # no edges between them
     path = g.get_shortest_path(a, b)
     self.assertEqual(path, []) # FIXME: shouldn't this be None?

Example #3

File: script.py Project: yinglang/gcc-python-plugin

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 #4

File: script.py Project: B-Rich/gcc-python-plugin

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 #5

File: supergraph.py Project: B-Rich/gcc-python-plugin

 def add_node(self, supernode):
     Graph.add_node(self, supernode)
     # Keep track of mapping from stmtnode -> supernode
     self.supernode_for_stmtnode[supernode.innernode] = supernode
     return supernode

Example #6

 def add_node(self, supernode):
     Graph.add_node(self, supernode)
     # Keep track of mapping from stmtnode -> supernode
     self.supernode_for_stmtnode[supernode.innernode] = supernode
     return supernode