code: def __init__(self, name=None):
      # We represent the adjacency matrix as a dict of dicts:
      # key: source node -> value: (key: destination node -> value: edge data (set))
      # Also, the graph nodes are stored in the order they were added.
      self._successors = OrderedDict()
      self._predecessors = OrderedDict()
      self.name = name
  
file_path: baikal/baikal/_core/digraph.py
imports: from collections import deque, defaultdict, OrderedDict
label_desc: Use image node_id 1 to create a new DiGraph object  with example: obj = DiGraph(name)