code: def graph_branches_from_node(self, node):
          
          # TODO: This method can be replaced and speed up by using NetworkX' neighbors()
  
          branches = []
          branches_dict = self._graph.adj[node]
          for branch in branches_dict.items():
              branches.append(branch)
          return sorted(branches, key=lambda _: repr(_))
docs: Returns branches that are connected to `node`
  
          Args
          ----
          node: GridDing0
              Ding0 object (member of graph)
          
          Returns
          -------
          :any:`list`
              List of tuples (node in :obj:`GridDing0`, branch in :obj:`BranchDing0`) ::
              
                  (node , branch_0 ),
                  ...,
                  (node , branch_N ),