old_contents: from networkx.algorithms.assortativity import *
  from networkx.algorithms.block import *
  from networkx.algorithms.boundary import *
  from networkx.algorithms.centrality import *
  from networkx.algorithms.cluster import *
  from networkx.algorithms.clique import *
  from networkx.algorithms.community import *
  from networkx.algorithms.components import *
  from networkx.algorithms.coloring import *
  from networkx.algorithms.core import *
  from networkx.algorithms.cycles import *
  from networkx.algorithms.dag import *
  from networkx.algorithms.distance_measures import *
  from networkx.algorithms.dominance import *
  from networkx.algorithms.dominating import *
  from networkx.algorithms.hierarchy import *
  from networkx.algorithms.hybrid import *
  from networkx.algorithms.matching import *
  from networkx.algorithms.minors import *
  from networkx.algorithms.mis import *
  from networkx.algorithms.mst import *
  from networkx.algorithms.link_analysis import *
  from networkx.algorithms.link_prediction import *
  from networkx.algorithms.operators import *
  from networkx.algorithms.shortest_paths import *
  from networkx.algorithms.smetric import *
  from networkx.algorithms.triads import *
  from networkx.algorithms.traversal import *
  from networkx.algorithms.isolate import *
  from networkx.algorithms.euler import *
  from networkx.algorithms.vitality import *
  from networkx.algorithms.chordal import *
  from networkx.algorithms.richclub import *
  from networkx.algorithms.distance_regular import *
  from networkx.algorithms.swap import *
  from networkx.algorithms.graphical import *
  from networkx.algorithms.simple_paths import *
  
  import networkx.algorithms.assortativity
  import networkx.algorithms.bipartite
  import networkx.algorithms.centrality
  import networkx.algorithms.cluster
  import networkx.algorithms.clique
  import networkx.algorithms.components
  import networkx.algorithms.connectivity
  import networkx.algorithms.coloring
  import networkx.algorithms.flow
  import networkx.algorithms.isomorphism
  import networkx.algorithms.link_analysis
  import networkx.algorithms.shortest_paths
  import networkx.algorithms.traversal
  import networkx.algorithms.chordal
  import networkx.algorithms.operators
  import networkx.algorithms.tree
  
  # bipartite
  from networkx.algorithms.bipartite import (projected_graph, project, is_bipartite,
      complete_bipartite_graph)
  # connectivity
  from networkx.algorithms.connectivity import (minimum_edge_cut, minimum_node_cut,
      average_node_connectivity, edge_connectivity, node_connectivity,
      stoer_wagner, all_pairs_node_connectivity, all_node_cuts)
  # isomorphism
  from networkx.algorithms.isomorphism import (is_isomorphic, could_be_isomorphic,
      fast_could_be_isomorphic, faster_could_be_isomorphic)
  # flow
  from networkx.algorithms.flow import (maximum_flow, maximum_flow_value,
      minimum_cut, minimum_cut_value, capacity_scaling, network_simplex,
      min_cost_flow_cost, max_flow_min_cost, min_cost_flow, cost_of_flow)
  
  from .tree.recognition import *
  from .tree.branchings import (
  	maximum_branching, minimum_branching,
  	maximum_spanning_arborescence, minimum_spanning_arborescence
  )
  
new_contents: from networkx.algorithms.approximation import *
  from networkx.algorithms.assortativity import *
  from networkx.algorithms.block import *
  from networkx.algorithms.boundary import *
  from networkx.algorithms.centrality import *
  from networkx.algorithms.cluster import *
  from networkx.algorithms.clique import *
  from networkx.algorithms.community import *
  from networkx.algorithms.components import *
  from networkx.algorithms.coloring import *
  from networkx.algorithms.core import *
  from networkx.algorithms.cycles import *
  from networkx.algorithms.dag import *
  from networkx.algorithms.distance_measures import *
  from networkx.algorithms.dominance import *
  from networkx.algorithms.dominating import *
  from networkx.algorithms.hierarchy import *
  from networkx.algorithms.hybrid import *
  from networkx.algorithms.matching import *
  from networkx.algorithms.minors import *
  from networkx.algorithms.mis import *
  from networkx.algorithms.mst import *
  from networkx.algorithms.link_analysis import *
  from networkx.algorithms.link_prediction import *
  from networkx.algorithms.operators import *
  from networkx.algorithms.shortest_paths import *
  from networkx.algorithms.smetric import *
  from networkx.algorithms.triads import *
  from networkx.algorithms.traversal import *
  from networkx.algorithms.isolate import *
  from networkx.algorithms.euler import *
  from networkx.algorithms.vitality import *
  from networkx.algorithms.chordal import *
  from networkx.algorithms.richclub import *
  from networkx.algorithms.distance_regular import *
  from networkx.algorithms.swap import *
  from networkx.algorithms.graphical import *
  from networkx.algorithms.simple_paths import *
  
  import networkx.algorithms.approximation
  import networkx.algorithms.assortativity
  import networkx.algorithms.bipartite
  import networkx.algorithms.centrality
  import networkx.algorithms.cluster
  import networkx.algorithms.clique
  import networkx.algorithms.components
  import networkx.algorithms.connectivity
  import networkx.algorithms.coloring
  import networkx.algorithms.flow
  import networkx.algorithms.isomorphism
  import networkx.algorithms.link_analysis
  import networkx.algorithms.shortest_paths
  import networkx.algorithms.traversal
  import networkx.algorithms.chordal
  import networkx.algorithms.operators
  import networkx.algorithms.tree
  
  # bipartite
  from networkx.algorithms.bipartite import (projected_graph, project, is_bipartite,
      complete_bipartite_graph)
  # connectivity
  from networkx.algorithms.connectivity import (minimum_edge_cut, minimum_node_cut,
      average_node_connectivity, edge_connectivity, node_connectivity,
      stoer_wagner, all_pairs_node_connectivity, all_node_cuts)
  # isomorphism
  from networkx.algorithms.isomorphism import (is_isomorphic, could_be_isomorphic,
      fast_could_be_isomorphic, faster_could_be_isomorphic)
  # flow
  from networkx.algorithms.flow import (maximum_flow, maximum_flow_value,
      minimum_cut, minimum_cut_value, capacity_scaling, network_simplex,
      min_cost_flow_cost, max_flow_min_cost, min_cost_flow, cost_of_flow)
  
  from .tree.recognition import *
  from .tree.branchings import (
  	maximum_branching, minimum_branching,
  	maximum_spanning_arborescence, minimum_spanning_arborescence
  )
  
subject: Add approximation import