Ejemplo n.º 1
0
 def __init__(self):
     """
     Initialize a graph.
     """
     common.__init__(self)
     labeling.__init__(self)
     self.node_neighbors = {}     # Pairing: Node -> Neighbors
Ejemplo n.º 2
0
 def __init__(self):
     """
     Initialize a graph.
     """
     common.__init__(self)
     labeling.__init__(self)
     self.node_neighbors = {}  # Pairing: Node -> Neighbors
Ejemplo n.º 3
0
 def __init__(self):
     """
     Initialize a digraph.
     """
     common.__init__(self)
     labeling.__init__(self)
     self.node_neighbors = {}     # Pairing: Node -> Neighbors
     self.node_incidence = {}     # Pairing: Node -> Incident nodes
Ejemplo n.º 4
0
 def __init__(self):
     """
     Initialize a digraph.
     """
     common.__init__(self)
     labeling.__init__(self)
     self.node_neighbors = {}  # Pairing: Node -> Neighbors
     self.node_incidence = {}  # Pairing: Node -> Incident nodes
Ejemplo n.º 5
0
 def __init__(self):
     """
     Initialize a hypergraph.
     """
     common.__init__(self)
     labeling.__init__(self)
     self.node_links = {}    # Pairing: Node -> Hyperedge
     self.edge_links = {}     # Pairing: Hyperedge -> Node
     self.graph = graph()    # Ordinary graph
 def __init__(self):
     """
     Initialize a hypergraph.
     """
     common.__init__(self)
     labeling.__init__(self)
     self.node_links = {}  # Pairing: Node -> Hyperedge
     self.edge_links = {}  # Pairing: Hyperedge -> Node
     self.graph = graph()  # Ordinary graph
Ejemplo n.º 7
0
 def __init__( self, G=None, inverted=False, reversed=False ):
     """
     Initialize a digraph.
     """
     if G:
         self.G = G
     else:
         self.G = {}
         
     common.__init__(self)
     labeling.__init__(self)