Take a root node and its children and make them into graphs

def root_and_children_to_graph(self,root):
     """Take a root node and its children and make them into graphs"""
     g = Graph()
     g.add_node(root)
     edges = []
     edges += self.get_node_edges(root,"outgoing")
     for c in self.get_children(root):
           g.add_node(c)
           edges += self.get_node_edges(c,"outgoing")
     for e in edges: g.add_edge(e)
     return g