class_docstr: Efficient basic implementation of nx `Graph' â€“ Undirected graphs with self loops
class_docstr_tok: ["Efficient","basic","implementation","of","nx","`","Graph","'","\u00e2\u20ac","\u201c","Undirected","graphs","with","self","loops"]
code: def make_undirected(self):
      t0 = time()
  
      for v in list(self):
          for other in self[v]:
              if v != other:
                  self[other].append(v)
  
      t1 = time()
      logger.info(
          "make_directed: added missing edges {}s".format(t1 - t0)
      )
  
      self.make_consistent()
      return self
  
imports: import logging
  import sys
  from io import open
  from os import path
  from time import time
  from glob import glob
  from six.moves import range, zip, zip_longest
  from six import iterkeys
  from collections import defaultdict, Iterable
  import random
  from random import shuffle
  from itertools import product, permutations
  from scipy.io import loadmat
  from scipy.sparse import issparse
label_desc: Use image node_id 5 for calling the Graph obj's underlying member method code with example usage: obj.make_undirected() and returns: self